921 search results - page 54 / 185 » New Data Structures for Orthogonal Range Searching |
139
click to vote
LCN
2008
IEEE
15 years 10 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
130
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
120
click to vote
JDWM
2007
15 years 3 months ago
2007
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
158
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
154
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...