88 search results - page 4 / 18 » Approximate Range Searching Using Binary Space Partitions |
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
SIAMCOMP
2002
13 years 5 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
ICDAR
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...