125 search results - page 20 / 25 » A Fast Parallel Clustering Algorithm for Large Spatial Datab... |
SC
2005
ACM
14 years 1 months ago
2005
ACM
The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating...
ECCV
2010
Springer
14 years 26 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
MST
2002
13 years 7 months ago
2002
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
DASFAA
2003
IEEE
14 years 28 days 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...
KAIS
2002
13 years 7 months ago
2002
A great challenge for web site designers is how to ensure users' easy access to important web pages efficiently. In this paper we present a clustering-based approach to addres...