868 search results - page 70 / 174 » A general compression algorithm that supports fast searching |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Many users need to refer to content in existing files (pictures, tables, emails, web pages and etc.) when they write documents(programs, presentations, proposals and etc.), and o...
JCDL
2009
ACM
14 years 3 months ago
2009
ACM
A lot of future-related information is available in news articles or Web pages. This information can however differ to large extent and may fluctuate over time. It is therefore di...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...