Sciweavers

587 search results - page 94 / 118
» New Algorithms for Text Fingerprinting
Sort
View
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
15 years 1 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
114
Voted
ENTCS
2002
134views more  ENTCS 2002»
14 years 9 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
87
Voted
EMNLP
2009
14 years 7 months ago
Toward Completeness in Concept Extraction and Classification
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
Eduard H. Hovy, Zornitsa Kozareva, Ellen Riloff
SIGIR
1997
ACM
15 years 1 months ago
Learning Routing Queries in a Query Zone
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
Amit Singhal, Mandar Mitra, Chris Buckley
70
Voted
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
15 years 10 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....