| Comments on Bufferbloat | M. Allman | ACM SIGCOMM Computer Communications, Vol. 3, No. 1, pp. 30-37 | January 2013 | Networking | [PDF]
|
| Measuring End-to-End Bulk Transfer Capacity | M. Allman | ACM SIGCOMM Internet Measurement Workshop. November 2001. | November 2001 | Networking | |
| A Comparison of RED's Byte and Packet Modes | W. Eddy and M. Allman | ACM SIGCOMM Student Poster Session, August 2002. | August 2002 | Networking | |
| On Estimating End-to-End Network Path Properties | M. Allman and V. Paxson | ACM SIGCOMM, September 1999, Cambridge, Massachusetts. | September 1999 | Networking | |
| On the Performance of Middleboxes | M. Allman | ACM SIGCOMM/Usenix Internet Measurement Conference, Miami, FL, USA | October 2003 | Networking | |
| Incentive Compatibility and Dynamics of Congestion Control | P. B. Godfrey, M. Schapira, A. Zohar, and S. Shenker | ACM SIGMETRICS Performance Evaluation Review, Vol. 36, Issue 1, pp. 95-106 | June 2010 | Networking | [PDF]
|
| The Click Modular Router | E. Kohler, R. Morris, B. Chen, J. Jannotti, and M.F. Kaashoek | ACM Transactions on Computer Systems 18 (3), August 2000, pages 263-297. | August 2000 | Networking | |
| DDoS Defense by Offense | M. Walfish, M. Vutukuru, H. Balakrishnan, D. Karger, and S. Shenker | ACM Transactions on Computer Systems, Vol. 28, Issue 1, No. 3 | March 2010 | Networking | [PDF]
|
| A Simple Algorithm for Finding Frequent Elements in Streams and Bags | R.M. Karp, S. Shenker, and C.H. Papadimitriou | ACM Transactions on Database Systems, Vol. 28, Issue 1, pp. 51-55 | March 2003 | Networking | [PDF]
|
| Implementing the Scale Vector-Thread Processor | R. Krashinsky, C. Batten, and K. Asanović | ACM Transactions on Design Automation of Electronic Systems (TODAES), Vol. 13, Issue 3, pp. 41:1-41:24 | July 2008 | Architecture | [PDF]
|
| Effects of Usage Based Feedback on Video Retrieval: A Simulation Based Study | D. Vallet, F. Hopfgartner, J. M. Jose, and P. Castells | ACM Transactions on Information Systems, Vol. 29, Issue 2, Article 11 | April 2011 | AI | [PDF]
|
| Dialocalizaton: Acoustic Speaker Diarization and Visual Localization as Joint Optimization Problem | G. Friedland, C. Yeo, and H. Hung | ACM Transactions on Multimedia Computing, Communications, and Applications, Vol. 6, No. 4, Article 27 | November 2010 | Speech | [PDF]
|
| Morph-Based Speech Recognition and Modeling of Out-of-Vocabulary Words Across Languages | M. Creutz, T. Hirsimäki, M. Kurimo, A. Puurula, J. Pylkkönen, V. Siivola, M. Varjokallio, E. Arisoy, M. Saraclar, and A. Stolcke | ACM Transactions on Speech and Language Processing, Vol. 5, Issue 1, pp. 1-29 | December 2007 | Speech | [PDF]
|
| Barter Trade Improves Message Delivery in Opportunistic Networks | L. Buttyan, L. Dora, M. Felegyhazi, and I. Vajda | Ad Hoc Networks, Vol. 8, Issue 1, pp. 1-14 | January 2010 | Networking | [PDF]
|
| Hybrid HMM/ANN Systems for Speech Recognition: Overview and New Research Directions | H. Bourlard and N. Morgan | Adaptive Processing of Sequences and Data Structures, C.L. Giles and M. Gori (Eds.), pp. 389-417, Lecture Notes in Artificial Intelligence (1387), Springer | 1998 | Speech | |
| Neural Nets, Routines and Semantic Networks | J.A. Feldman and L. Shastri | Advances in Cognitive Science, N. Sharkey (ed.), Ellis Horwood Publishers | 1986 | AI | |
| On the security of ping-pong protocols | D. Dolev, S. Even, and R. M. Karp. Edited by: D. Chaum, R.L. Rivest, and A.T. Sherman | Advances in Cryptology: Proceedings of Crypto 82, Santa Barbara, California, pp. 177-86 | August 1982 | Algorithms | |
| Feature Selection Based on Joint Mutual Information | H. Yang and J. Moody | Advances in Intelligent Data Analysis (AIDA), Computational Intelligence Methods and Applications (CIMA), International Computer Science Conventions, Rochester, New York, June 22-25, 1999. | June 1999 | Algorithms | |
| Smoothing Regularizers for Projective Basis Function Networks | J. Moody and T. Rognvaldsson | Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. | 1997 | Algorithms | |
| Weight-Space Probability Densities and Equilibria in Stochastic Learning | T.K. Leen and J. Moody | Advances in Neural Information Processing Systems 5, Hanson, Cowan, and Giles (eds), Morgan Kaufmann Publishers, San Mateo, California | 1993 | Algorithms | |
| Multi-Effect Decompositions for Financial Data Modeling | L. Wu and J. Moody | Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. | 1997 | Algorithms | |
| The Effective Number of Parameters: an Analysis of Generalization and Regularization in Nonlinear Learning Systems | J. Moody | Advances in Neural Information Processing Systems Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto, pp. 847-854 | 1992 | Algorithms | |
| Fast Learning in Multi-Resolution Hierarchies | J. Moody | Advances in Neural Information Processing Systems, D. Touretzky, editor, Morgan Kauffmann | 1989 | Algorithms | |
| Search for Information Bearing Components in Speech | H.H. Yang and H. Hermansky | Advances in Neural Information Processing Systems, Vol. 12, S.A. Solla, T.K. Leen and K.-R. Muller, eds., MIT Press | 2000 | Speech | |
| Note on Development of Modularity in Simple Cortical Models | A. Chernjavsky and J. Moody | Advances in Neural Information Processing Systems, Vol. 2, D. Touretzky, ed., Morgan Kaufmann, Palo Alto | 1990 | Algorithms | |
| Note on Learning Rate Schedules for Stochastic Optimization | C. Darken and J. Moody | Advances in Neural Information Processing Systems, Vol. 3, Lippmann, Moody, and Touretzky, eds. Morgan Kaufmann, Palo Alto | 1991 | Algorithms | |
| Towards Faster Stochastic Gradient Search | C. Darken and J. Moody | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Principled Architecture Selection for Neural Networks: Application to Corporate Bond Rating Prediction | J. Moody and J. Utans | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Networks with Learned Unit Response Functions | J. Moody and N. Yarvin | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto, pp. 1048-1055 | 1992 | Algorithms | |
| Fast Pruning Using Principal Components | A.U. Levin, T.K. Leen, and J.E. Moody | Advances in Neural Information Processing Systems, Vol. 6, Cowan, Tesauro, and Alspector (eds), Morgan Kaufmann Publishers, San Mateo, California | 1994 | Algorithms | |
| A Continuous Speech Recognition System Embedding MLP into HMM | H. Bourlard and N. Morgan | Advances in Neural Information Processing Systems, Vol. II, pp. 186-193 | 1990 | Speech | |
| Connectionist Approaches to the Use of Markov Models for Continuous Speech Recognition | H. Bourlard and N. Morgan | Advances in Neural Information Processing Systems, Vol. III, pp. 213-219 | 1991 | Speech | |
| Connectionist Optimisation of Tied Mixture Hidden Markov Models | S. Renals, N. Morgan, H. Bourlard, M. Cohen, and H. Franco | Advances in Neural Information Processing Systems, Vol. IV, pp. 167-174 | 1991 | Speech | |
| Context-Dependent Multiple Distribution Phonetic Modeling | M. Cohen, H. Franco, N. Morgan, D. Rumelhart, and V. Abrash | Advances in Neural Information Processing Systems, Vol. V, pp. 649-657 | 1993 | Speech | |
| Modeling Consistency in a Speaker Independent Continuous Speech Recognition System | Y. Konig, N. Morgan, C. Wooters, V. Abrash, M. Cohen, and H. Franco | Advances in Neural Information Processing Systems, Vol. V, pp. 682-687 | 1993 | Speech | |
| Constructing Heterogeneous Committees via Input Feature Grouping | Y. Liao and J. Moody | Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.-R. Muller (eds.),MIT Press, 2000. | 2000 | Algorithms | |
| Data Visualization and Feature Selection: New Algorithms for Nongaussian Data | H. Yang and J. Moody | Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.R. Muller (eds.), MIT Press, 2000. | 2000 | Algorithms | |
| An Essay Concerning Robotic Understanding | J.A. Feldman | AI Magazine, Vol. 11, pp. 12-13 | 1990 | AI | |
| Automated Generation of Search Tree Algorithms for Hard Graph-Modification Problems | J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier | Algorithmica, 39(4):321-347 | January 05 2004 | Algorithms | |
| Mapping Clones with a Given Ordering or Interleaving | T. Jiang and R.M. Karp | Algorithmica, July 1998, vol.21, (no.3):262-84. | 1998 | Algorithms | |
| On the power of randomization in on-line algorithms | S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson | Algorithmica, Vol. 11, No. 1, pp. 2-14 | January 1994 | Algorithms | |
| Coding techniques for handling failures in large disk arrays | L. Hellerstein, G.A. Gibson, R. M. Karp, R.M. Katz, and D.A. Patterson | Algorithmica, Vol. 12, No. 2-3, pp. 182-208 | August 1994 | Algorithms | |
| Efficient PRAM Simulation on a Distributed Memory Machine | R.M. Karp, M. Luby, and F. Meyer auf der Heide | Algorithmica, Vol. 16, No. 4-5, pp. 517-42 | October 1996 | Algorithms | |
| A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | H. Alt, L. Guibas, K. Mehlhorn, R. M. Karp, et al. | Algorithmica, Vol. 16, No. 4-5, pp. 543-547 | October 1996 | Algorithms | |
| Global wire routing in two-dimensional arrays | R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani | Algorithmica, Vol. 2, No.1, pp. 113-29 | 1987 | Algorithms | |
| On Mixing and Edge Expansion Properties in Randomized Broadcasting | T. Sauerwald | Algorithmica, Vol. 56, No. 1, pp. 51-88 | January 2010 | Algorithms | |
| FFD bin packing for item sizes with uniform distributions on (0, 1/2) | S. Floyd and R. M. Karp | Algorithmica, Vol. 6, No. 2, pp. 222-40 | 1991 | Algorithms | |
| Error-Resilient DNA Computation. Random Structures & Algorithms, Random Struct | R.M. Karp, C. Kenyon, and O. Waarts | Algorithms (USA), vol.15, (no.3-4), Wiley, Oct.-Dec. 1999. p.450-66. 19 | October 1999 | Algorithms | |
| A Heuristic for the Stacker Crane Problem on Trees Which is Almost Surely Exact | A. Coja-Oghlan, S.O. Krumke, and T. Nierhoff | Algorithms and Computation, 14th International Sympsium, ISAAC 2003, LNCS 2906, pp. 605-614, Springer | 2003 | Algorithms | |
| A Comparison of Phasing Algorithms for Trios and Unrelated Individuals | J. Marchini, D. Cutler, N. Patterson, M. Stephens, E. Eskin, E. Halperin, S. Lin, S. Qin, G. Abecassis, H. Munro, and P. Donnelly | American Journal of Human Genetics, Vol. 78, Issue 3, pp. 437-450 | March 2006 | Algorithms | |