274 search results - page 23 / 55 » Approximating Edit Distance Efficiently |
ICDE
2000
IEEE
14 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
CGF
2008
13 years 10 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
AUSAI
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
JUCS
2008
13 years 9 months ago
2008
Abstract: As web sites are getting more complicated, the construction of web information extraction systems becomes more troublesome and time-consuming. A common theme is the diffi...
CPM
2006
Springer
14 years 1 months ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...