2883 search results - page 73 / 577 » Algorithms for merged indexes |
136
click to vote
CIMCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
131
click to vote
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
106
Voted
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
147
click to vote
CPM
1999
Springer
15 years 9 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
264
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...