Publications

Export 367 results:
[ Author(Desc)] Title Type Year
Filters: First Letter Of Last Name 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
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, 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.  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.  Generating dynamic content at database-backed web servers. ACM SIGMOD RecordSIGMOD Rec.. 29(1):26-31.
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.  2000.  WebView materialization. SIGMOD Rec.. 29(2):367-378.
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, 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.
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.
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.
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.
Lam H, Bertini E, Isenberg P, Plaisant C, Carpendale S.  2011.  Seven guiding scenarios for information visualization evaluation. 2011-992-04
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.
Landau GM, Vishkin U, Nussinov R.  1990.  [31] Fast alignment of DNA and protein sequences. Methods in Enzymology. 183:487-502.
Landau GM, Vishkin U.  1986.  Efficient Parallel and Serial String Matching. Computer Science Department Technical Report. 221
Landau GM, Vishkin U.  1988.  Fast string matching with k differences.. J. COMP. SYST. SCI.. 37(1):63-78.
Landau G, Vishkin U.  1993.  Two dimensional pattern matching in a digitized image. Combinatorial Pattern Matching. :134-151.
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.  1985.  Efficient string matching in the presence of errors. Foundations of Computer Science, 1985., 26th Annual Symposium on. :126-136.
Landau GM, Vishkin U.  1994.  Pattern matching in a digitized image. Algorithmica. 12(4):375-408.
Landau G, Schieber B, Vishkin U.  1987.  Parallel construction of a suffix tree. Automata, Languages and Programming. :314-325.
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.

Pages