57 search results - page 9 / 12 » Lightweight Data Indexing and Compression in External Memory |
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
2010
Eurographics
Hierarchical culling is a key acceleration technique used to efficiently handle massive models for ray tracing, collision detection, etc. To support such hierarchical culling, bo...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
101
click to vote
DASFAA
2003
IEEE
15 years 3 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
SDM
2010
SIAM
14 years 12 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...