Publications

Export 7148 results:
[ Author(Desc)] Title 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 
K
Kuter U, Nau DS, Reisner E, Goldman R.  2007.  Conditionalization: Adapting forward-chaining planners to partially observable environments.
Kuter U, Nau DS, Pistore M, Traverso P.  2009.  Task decomposition on abstract states, for planning under nondeterminism. Artificial Intelligence. 173(5–6):669-695.
Kuter U, Nau DS.  2005.  Using domain-configurable search control for probabilistic planning. 20:1169-1169.
Kuter U, Nau DS.  2006.  Controlled search over compact state representations, in nondeterministic planning domains and beyond. 21:1638-1638.
Kuter U, Nau DS, Pistore M, Traverso P.  2005.  A hierarchical task-network planner based on symbolic model checking. :300-309.
Kutten S, Peleg D, Vishkin U.  2003.  Deterministic Resource Discovery in Distributed Networks. Theory of Computing Systems. 36(5):479-495.
L
La RJ, Shayman MA, Bhattacharjee B.  2006.  Measurement-based optimal routing on overlay architectures for unicast sessions. Computer Networks. 50(12):1938-1951.
Labrinidis A, Roussopoulos N.  2004.  Exploring the tradeoff between performance and data freshness in database-driven web servers. The VLDB Journal. 13(3):240-255.
Labrinidis A, Roussopoulos N.  2000.  WebView materialization. SIGMOD Rec.. 29(2):367-378.
Labrinidis A, Roussopoulos N.  2003.  Balancing performance and data freshness in web database servers. Proceedings of the 29th international conference on Very large data bases-Volume 29. :393-404.
Labrinidis A, Roussopoulos N, SCIENCE MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER.  2001.  Update propagation strategies for improving the quality of data on the web. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES. :391-400.
Labrinidis A, Roussopoulos N.  2000.  Generating dynamic content at database-backed web servers. ACM SIGMOD RecordSIGMOD Rec.. 29(1):26-31.
LaCount DJ, El-Sayed NM, Kaul S, Wanless D, Turner CMR, Donelson JE.  2001.  Analysis of a donor gene region for a variant surface glycoprotein and its expression site in African trypanosomes. Nucleic acids research. 29(10):2012-2012.
Lacroix Z, Raschid L, Eckman BA.  2004.  Techniques for optimization of queries on integrated biological resources. Journal of bioinformatics and computational biology. 2(2):375-412.
Lacroix Z, Raschid L, Vidal ME.  2004.  Efficient techniques to explore and rank paths in life science data sources. Data Integration in the Life Sciences. :187-202.
Lacroix Z, Murthy H, Naumann F, Raschid L.  2004.  Links and paths through life sciences data sources. Data Integration in the Life Sciences. :203-211.
Lacroix Z, Moths T, Parekh K, Raschid L, Vidal M-E.  2004.  Exploiting multiple paths to express scientific queries. 16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings. :357-360.
Lai M-Y, Zhang D, LaRonde-LeBlanc N, Fushman D.  2012.  Structural and biochemical studies of the open state of Lys48-linked diubiquitin. Biochimica et Biophysica Acta (BBA) - Molecular Cell Research.
Lai V, Rajashekar C, Rand W.  2011.  Comparing Social Tags to Microblogs. Privacy, security, risk and trust (passat), 2011 IEEE third international conference on and 2011 IEEE third international conference on social computing (socialcom). :1380-1383.
Lam H, Bertini E, Isenberg P, Plaisant C, Carpendale S.  2011.  Empirical Studies in Information Visualization: Seven Scenarios. Visualization and Computer Graphics, IEEE Transactions on. PP(99):1-1.
Lam H, Bertini E, Isenberg P, Plaisant C, Carpendale S.  2011.  Seven guiding scenarios for information visualization evaluation. 2011-992-04
Landau GM, Vishkin U, Nussinov R.  1986.  An efficient string matching algorithm with k differences for nudeotide and amino acid sequences. Nucleic acids research. 14(1):31-31.
Landau GM, Vishkin U, Nussinov R.  1988.  Locating alignments with k differences for nucleotide and amino acid sequences. Computer applications in the biosciences: CABIOS. 4(1):19-19.
Landau GM, Vishkin U.  1986.  Introducing efficient parallelism into approximate string matching and a new serial algorithm. Proceedings of the eighteenth annual ACM symposium on Theory of computing. :220-230.
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.

Pages