Publications

Export 231 results:
[ Author(Desc)] Title 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 
B
Boutellier J, Bhattacharyya SS, Silvén O.  2010.  A Low-overhead Scheduling Methodology for Fine-grained Acceleration of Signal Processing Systems. Journal of Signal Processing Systems. 60(3):333-343.
Boutellier J, Bhattacharyya SS, Silvén O.  2007.  Low-overhead run-time scheduling for fine-grained acceleration of signal processing systems. Signal Processing Systems, 2007 IEEE Workshop on. :457-462.
Boyd-Graber J.  2010.  Linguistic Extensions of Topic Models.
Brakerski Z, Katz J, Segev G, Yerukhimovich A.  2011.  Limits on the power of zero-knowledge proofs in cryptographic constructions. Theory of Cryptography. :559-578.
Bulka B, Gaston M, desJardins M.  2007.  Local strategy learning in networked multi-agent team formation. Autonomous Agents and Multi-Agent Systems. 15(1):29-45.
Bullock SS, O'Leary DP.  2009.  Locality bounds on hamiltonians for stabilizer codes. Quantum Info. Comput.. 9(5):487-499.
Byrka J, Ghodsi M, Srinivasan A.  2010.  LP-rounding algorithms for facility-location problems. arXiv:1007.3611.
C
Chandra R, Lefever RM, Cukier M, Sanders WH.  2000.  Loki: a state-driven fault injector for distributed systems. :237-242.
Cheng K-L, Zuckerman I, Nau DS, Golbeck J.  2011.  The Life Game: Cognitive Strategies for Repeated Stochastic Games. :95-102.
Cho S, Reggia JA.  1993.  Learning competition and cooperation. Neural computation. 5(2):242-259.
Cho S, Reggia JA.  1992.  Learning visual coordinate transformations with competition. Neural Networks, 1992. IJCNN., International Joint Conference on. 4:49-54.
Cleaveland R, Steffen B.  1993.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal methods in system design. 2(2):121-147.
Conroy JM, Schlesinger JD, Goldstein J, O'Leary DP.  2004.  Left-Brain/Right-Brain Multi-Document Summarization. DUC 04 Conference ProceedingsDUC 04 Conference Proceedings.
Cook D, Faber V, Marathe M, Srinivasan A, Sussmann Y.  1998.  Low-bandwidth routing and electrical power networks. Automata, Languages and ProgrammingAutomata, Languages and Programming. 1443:604-615.
D
Daumé H, Marcu D.  2005.  Learning as search optimization: approximate large margin methods for structured prediction. Proceedings of the 22nd international conference on Machine learning. :169-176.
Daumé H, Marcu D.  2005.  A large-scale exploration of effective global features for a joint entity detection and tracking model. Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing. :97-104.
Deshpande A, Hellerstein JM.  2004.  Lifting the burden of history from adaptive query processing. Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. :948-959.
desJardins M, Rathod P, Getoor L.  2008.  LEARNING STRUCTURED BAYESIAN NETWORKS: COMBINING ABSTRACTION HIERARCHIES AND TREE‐STRUCTURED CONDITIONAL PROBABILITY TABLES. Computational Intelligence. 24(1):1-22.
desJardins M, Eaton E, Wagstaff KL.  2006.  Learning user preferences for sets of objects. Proceedings of the 23rd international conference on Machine learning. :273-280.
Doermann D, Rivlin E, Weiss I.  1993.  Logo Recognition. CS-TR-3145
Doermann D, Ma H, Karagol-Ayan B, Oard D.  2002.  Lexicon Acquisition from Bilingual Dictionaries. SPIEPhotonic West Electronic Imaging Conference. :37-48.
Doermann D, Rivlin E, Weiss I.  1993.  Logo Recognition using Geomentric Invariants. ICDAR. :894-897.
Doppa J, Yu J, Tadepalli P, Getoor L.  2010.  Learning algorithms for link prediction based on chance constraints. Machine Learning and Knowledge Discovery in Databases. :344-360.
Dorr BJ.  1990.  Lexical conceptual structure and machine translation.
Dorr BJ.  1997.  LCS-based Korean Parsing and Translation. Ms. Institute for Advanced Computer Studies and Department of Computer Science, University of Maryland.

Pages