Publications
Export 1435 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is K [Clear All Filters]
2001. Mandarin-English Information (MEI): investigating translingual speech retrieval. Proceedings of the first international conference on Human language technology research. :1-7.
2001. Modeling information content using observable behavior. PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE. 38:481-488.
2001. Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences. 41(3):349-364.
2001. Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences. 41(3):349-364.
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.
2001. Performance optimization for data intensive grid applications. Active Middleware Services, 2001. Third Annual International Workshop on. :97-105.
2001. Probabilistic models of text and link structure for hypertext classification. IJCAI workshop on text learning: beyond supervision. :24-29.
2001. A prototype experience management system for a software consulting organization. Thirteenth International Conference on Software Engineering and Knowledge Engineering. :29-36.
2001. The role of a natural language conversational interface in online sales: A case study. International Journal of Speech Technology. 4(3):285-295.
2001. Unforgeable encryption and chosen ciphertext secure modes of operation. Fast Software Encryption. :25-36.
2001. User modeling for information access based on implicit feedback. 3rd Symposium of ISKO-France, Information Filtering and Automatic Summarisation in networds.
2001. Visualization of large data sets with the Active Data Repository. IEEE Computer Graphics and Applications. 21(4):24-33.
2000. Algorithm 805: computation and uses of the semidiscrete matrix decomposition. ACM Trans. Math. Softw.. 26(3):415-435.
2000. The analysis of a simple k-means clustering algorithm. Proceedings of the sixteenth annual symposium on Computational geometry. :100-109.
2000. Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica. 28(4):422-437.