Publications

Found 166 results
Author [ Title(Asc)] Type Year
Filters: First Letter Of Title is L  [Clear All Filters]
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
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.
Freivalds, R., & Karpinski M. (1994).  Lower Space Bounds for Randomized Computation.
Grigoriev, D. Yu., Karpinski M., & Vorobjov N. (1993).  Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Grigoriev, D. Yu., & Karpinski M. (1993).  Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees.
Kääriäinen, M., & Langford J. (2006).  Lower Bounds for Reductions.
Grigoriev, D. Yu., Karpinski M., der Heide F. Meyer auf, & Smolensky R. (1995).  A Lower Bound for Randomized Algebraic Decision Trees.
Ablayev, F., & Karpinski M. (1997).  A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs.
Hunold, S. (2010).  Low-Cost Tuning of Two-Step Algorithms for Scheduling Mixed-Parallel Applications onto Homogeneous Clusters. 253-261.
Jantz, K., Friedland G., Knipping L., & Rojas R. (2007).  A Low-Cost Mobile Pointing and Drawing Device. 121-122.
Chiang, H-L., Kadur T., Rave W., & Fettweis G. (2016).  Low-complexity spatial channel estimation and hybrid beamforming for millimeter wave links. 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). 1-7.
Elizalde, B. Martinez, & Friedland G. (2013).  Lost in Segmentation: Three Approaches for Speech/Non-Speech Detection in Consumer-Produced Videos.
Argyraki, K., Maniatis P., Irzak O.., Subramanian A.., & Shenker S. J. (2007).  Loss and Delay Accountability for the Internet. 194-205.
Khattak, S., Javed M., Khayam S. Ali, Uzmi Z. Afzal, & Paxson V. (2014).  A Look at the Consequences of Internet Censorship Through an ISP Lens.
Chen, B. Y., Zhu Q., & Morgan N. (2004).  Long-Term Temporal Features for Conversational Speech Recognition. Proceedings of the First International Workshop on Machine Learning for Multimodal Interaction (MLMI 2004).
Donahue, J., Hendricks L. Anne, Guadarrama S., Rohrbach M., Venugopalan S., Saenko K., et al. (2015).  Long-Term Recurrent Convolutional Networks for Visual Recognition and Description.
Borghoff, U. M., Roedig P.., Scheffczyk J., & Schmitz L.. (2006).  Long-Term Preservation of Digital Documents: Principles and Practices.
Wang, X., Lian L., Miao Z., Liu Z., & Yu S. X. (2021).  Long-tailed Recognition by Routing Diverse Distribution-Aware Experts. Proceedings of International Conference on Learning Representations.
Willinger, W., Paxson V., Riedi R. H., & Taqqu M. S. (2002).  Long-Range Dependence and Data Network Traffic.
Callahan, T., Allman M., & Paxson V. (2010).  A Longitudinal View of HTTP Traffic.
Tsai, T.. J., & Morgan N. (2012).  Longer Features: They Do a Speech Detector Good.
Riedhammer, K., Favre B., & Hakkani-Tür D. (2010).  Long Story Short - Global Unsupervised Models for Keyphrase Based Meeting Summarization. Speech Communication. 52(10), 801-815.
Amann, J., Sommer R., Sharma A., & Hall S. (2012).  A Lone Wolf No More: Supporting Network Intrusion Detection with Real-Time Intelligence. 314-333.
Kushilevitz, E., Ostrovsky R., & Rosén A. (1994).  LOG-Space Polynomial End-to-End Communication.
Tantau, T. (2004).  A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.
Culler, D. E., Karp R. M., Patterson D., Sahay A., Schauser K. Erik, Santos E. E., et al. (1993).  LogP: towards a realistic model of parallel computation. SIGPLAN Notices. 28,

Pages