2883 search results - page 7 / 577 » Algorithms for merged indexes |
ISCI
2006
13 years 7 months ago
2006
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
SSDBM
2010
IEEE
13 years 11 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
IPMI
1999
Springer
14 years 8 months ago
1999
Springer
An algorithm for improved automatic segmentation of gross anatomical structures of the human brain is presented that merges the output of a tissue classification process with gross...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...