Publications

Found 4258 results
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
L
Kääriäinen, M., & Langford J. (2006).  Lower Bounds for Reductions.
Grigoriev, D. Yu., & Karpinski M. (1993).  Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees.
Grigoriev, D. Yu., Karpinski M., & Vorobjov N. (1993).  Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Freivalds, R., & Karpinski M. (1994).  Lower Space Bounds for Randomized Computation.
Eshragh, A., Roosta F., Nazari A., & Mahoney M. (2022).  LSAR: Efficient Leverage Score Sampling Algorithm for the Analysis of Big Time Series Data. Journal of Machine Learning Research. 23, 1-36.
M
Voisard, A., & Ziekow H. (2010).  Mātārere: A Layered Framework for Specifying Event-Based Systems.
Bharghavan, V., Demers A. J., Shenker S. J., & Zhang L. (1994).  MACAW: A Media Access Protocol for Wireless LAN's. Proceedings of the Conference on Communications Architectures, Protocols and Applications (SIGCOMM '94). 212-225.
Feldman, J. (1969).  Machine Intelligence. 14, 490-492.
Darrell, T., Kloft M., Pontil M., Rätsch G., & Rodner E. (2015).  Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152). Dagstuhl Reports. 5, 18–55.
Kramer, O. (2011).  Machine Symbol Grounding and Optimization.
Moody, J. (1995).  Macroeconomic Forecasting: Challenges and Neural Network Solutions. Proceedings of the International Symposium on Artificial Neural Networks.
Bialek, W.., Moody J., & Wilczek F. (1986).  Macroscopic T Nonconservation: Prospects for a New Experiment. 56,
Raghavan, B., & Hasan S. (2012).  Macroscopically Sustainable Networking: An Internet Quine.
Dagum, P. (1990).  On the Magnification of Exchange Graphs with Applications to Enumeration Problems (Thesis).
Mirghafori, N., Fosler-Lussier E., & Morgan N. (1995).  Making Automatic Speech Recognition More Robust to Fast Speech.
Harchol, Y., Mushtaq A., Fang V., McCauley J. Murphy, Panda A., & Shenker S. J. (2020).  Making edge-computing resilient. SoCC '20: Proceedings of the 11th ACM Symposium on Cloud Computing. 253-266.
Chawathe, Y., Ratnasamy S., Breslau L., & Shenker S. J. (2003).  Making Gnutella-Like P2P Systems Scalable. Proceedings of ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM). 407-418.
Shenker, S. J. (1995).  Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines. IEEE/ACM Transactions on Networking. 3(6), 819-831.
Blanton, E., & Allman M. (2002).  On Making TCP More Robust to Packet Reordering.
Raghavan, B., Koponen T., Ghodsi A., Brajkovic V., & Shenker S. J. (2012).  Making the Internet More Evolvable.
Stolcke, A. (2011).  Making the Most from Multiple Microphones in Meeting Recognition. 4992-4995.
Gairing, M. (2008).  Malicious Bayesian Congestion Games. 119-132.
Ulrich, R. (1996).  A Management Platform for Global Area ATM Networks.
Ulrich, R., & Kritzinger P. (1996).  Managing ABR Capacity in Reservation-based Slotted Networks.
Kramer, O., Satzger B., & Lässig J. (2010).  Managing Energy in a Virtual Power Plant Using Learning Classifier Systems.

Pages