Publications

Export 1435 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is K  [Clear All Filters]
2001
Meng H, Chen B, Khudanpur S, Levow G-A, Lo W-K, Oard D, Schone P, Tang K, Wang H-M, Wang J.  2001.  Mandarin-English Information (MEI): investigating translingual speech retrieval. Proceedings of the first international conference on Human language technology research. :1-7.
Oard D, Kim J.  2001.  Modeling information content using observable behavior. PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE. 38:481-488.
Kianzad V, Bhattacharyya SS.  2001.  Multiprocessor clustering for embedded systems. Euro-Par 2001 Parallel Processing. :697-701.
Ben-Yashar R, Khuller S, Kraus S.  2001.  Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences. 41(3):349-364.
Ben-Yashar R, Khuller S, Kraus S.  2001.  Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences. 41(3):349-364.
Jacobs DW.  2001.  Perceptual organization as generic object recognition. From Fragments to Objects Segmentation and Grouping in VisionFrom Fragments to Objects Segmentation and Grouping in Vision. Volume 130:295-329.
Beynon MD, Sussman A, Catalyurek U, Kurc T, Saltz J.  2001.  Performance optimization for data intensive grid applications. Active Middleware Services, 2001. Third Annual International Workshop on. :97-105.
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.
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.
Mendonça Neto MG, Seaman C, Basili VR, Kim YM.  2001.  A prototype experience management system for a software consulting organization. Thirteenth International Conference on Software Engineering and Knowledge Engineering. :29-36.
Jajodia S, Kudo M, V.S. Subrahmanian.  2001.  Provisional authorizations. E-commerce Security and Privacy. 2:133-159.
Chai J, Jimmy Lin, Zadrozny W, Ye Y, Stys-Budzikowska M, Horvath V, Kambhatla N, Wolf C.  2001.  The role of a natural language conversational interface in online sales: A case study. International Journal of Speech Technology. 4(3):285-295.
Getoor L, Taskar B, Koller D.  2001.  Selectivity estimation using probabilistic models. ACM SIGMOD Record. 30(2):461-472.
Kotidis1⋆ Y, Sismanis Y, Roussopoulos N.  2001.  Shared index scans for data warehouses. Data Warehousing and Knowledge Discovery. :307-316.
Dix J, Kraus S, V.S. Subrahmanian.  2001.  Temporal agent programs. Artificial Intelligence. 127(1):87-135.
Doermann D, Ma H, Karagol-Ayan B, Oard D.  2001.  Translation lexicon acquisition from bilingual dictionaries. Proceedings of SPIE. 4670:37-37.
Katz J, Yung M.  2001.  Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
Kim J, Oard D, Romanik K.  2001.  User modeling for information access based on implicit feedback. 3rd Symposium of ISKO-France, Information Filtering and Automatic Summarisation in networds.
Kurc T, Catalyurek U, Chang C, Sussman A, Saltz J.  2001.  Visualization of large data sets with the Active Data Repository. IEEE Computer Graphics and Applications. 21(4):24-33.
Hassin R, Khuller S.  2001.  z-Approximations. Journal of Algorithms. 41(2):429-442.
2000
Ertugay O, Hicks MW, Smith J, Kornblum J.  2000.  Agents in Network Management. Technical Reports (CIS).
Kolda TG, O'Leary DP.  2000.  Algorithm 805: computation and uses of the semidiscrete matrix decomposition. ACM Trans. Math. Softw.. 26(3):415-435.
Kanungo T, Mount D, Netanyahu NS, Piatko C, Silverman R, Wu AY.  2000.  The analysis of a simple k-means clustering algorithm. Proceedings of the sixteenth annual symposium on Computational geometry. :100-109.
Guttmann-Beck N, Hassin R, Khuller S, Raghavachari B.  2000.  Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica. 28(4):422-437.
Zotkin DN, Keleher PJ, Perkovic D.  2000.  Attacking the bottlenecks of backfilling schedulers. Cluster Computing.

Pages