46 search results - page 9 / 10 » Efficient k-NN search on vertically decomposed data |
DEXA
2005
Springer
13 years 10 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
TIP
2010
12 years 12 months ago
2010
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
SIAMSC
2008
13 years 5 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
ISAAC
2010
Springer
13 years 3 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...