Publications

Export 1435 results:
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
Journal Articles
Kuah B-T, Shneiderman B.  1998.  Providing Advisory Notices for UNIX Command Users: Design, Implementation, and Empirical Evaluations. Technical Reports of the Computer Science Department.
Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2007.  Provable algorithms for joint optimization of transport, routing and MAC layers in wireless ad hoc networks. Proc. DialM-POMC Workshop on Foundations of Mobile Computing.
Khan Z, Bloom JS, Garcia BA, Singh M, Kruglyak L.  2009.  Protein quantification across hundreds of experimental conditions. Proceedings of the National Academy of Sciences. 106(37):15544-15548.
Khan Z, Bloom JS, Garcia BA, Singh M, Kruglyak L.  2009.  Protein quantification across hundreds of experimental conditions. Proceedings of the National Academy of Sciences. 106(37):15544-15548.
Ateniese G, Kamara S, Katz J.  2009.  Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
Ateniese G, Kamara S, Katz J.  2009.  Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
Khuller S, Mitchell SG, Vazirani VV.  1992.  Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
Beynon M, Chang C, Catalyurek U, Kurc T, Sussman A, Andrade H, Ferreira R, Saltz J.  2002.  Processing large-scale multi-dimensional data in parallel and distributed environments. Parallel Computing. 28(5):827-859.
Deligiannakis A, Kotidis Y, Roussopoulos N.  2006.  Processing approximate aggregate queries in wireless sensor networks. Information Systems. 31(8):770-792.
Zhou S, Krueger V, Chellappa R.  2003.  Probabilistic recognition of human faces from video. Computer Vision and Image Understanding. 91(1–2):214-245.
Getoor L, Segal E, Taskar B, Koller D.  2001.  Probabilistic models of text and link structure for hypertext classification. IJCAI workshop on text learning: beyond supervision. :24-29.
Gupta A, Kembhavi A, Davis LS.  2009.  Probabilistic graphical models. IEEE transactions on pattern analysis and machine intelligence. 31(10):1775-1789.
Huang Y, Evans D, Katz J.  2011.  Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? 19th Network and Distributed Security Symposium.
Kim J-S, Andrade H, Sussman A.  2007.  Principles for designing data-/compute-intensive distributed applications and middleware systems for heterogeneous environments. Journal of Parallel and Distributed Computing. 67(7):755-771.
Roussopoulos N, Kang H.  1986.  Principles and techniques in the design of ADMS+((advanced data-base management system)). Computer. 19:19-23.
Khan Z, Ford MJ, Cusanovich DA, Mitrano A, Pritchard JK, Gilad Y.  2013.  Primate Transcript and Protein Expression Levels Evolve Under Compensatory Selection Pressures. Science. 342(6162):1100-1104.
Khuller S, Vishkin U, Young N.  1994.  A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal Algorithms. 17(2):280-289.
Alexander DS, Menage PB, Keromytis AD, Arbaugh WA, Anagnostakis KG, Smith JM.  2001.  The price of safety in an active network. Journal of Communications and Networks. 3(1):4-18.
Yilmaz C, Memon AM, Porter A, Krishna AS, Schmidt DC, Gokhale A, Natarajan B.  2004.  Preserving distributed systems critical properties: a model-driven approach. Software, IEEE. 21(6):32-40.
Khan Z, Bloom JS, Kruglyak L, Singh M.  2009.  A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics. 25(13):1609-1616.
Khan Z, Bloom JS, Kruglyak L, Singh M.  2009.  A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics. 25(13):1609-1616.
Navlakha S, Kingsford C.  2010.  The power of protein interaction networks for associating genes with diseases. Bioinformatics. 26(8):1057-1057.
Kurkulos M, Weinberg JM, Pepling ME, Mount SM.  1991.  Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Hicks MW, Kakkar P, Moore JT, Gunter CA, Alexander DS, Nettles S.  1998.  The PLAN system for building Active Networks. University of Pennsylvania (February 27, 1998).

Pages