736 search results - page 83 / 148 » A dynamic data structure for approximate range searching |
132
click to vote
CPM
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
140
Voted
BIOINFORMATICS
2011
14 years 7 months ago
2011
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
155
click to vote
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
122
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
133
click to vote
ICDT
2001
ACM
15 years 7 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...