324 search results - page 19 / 65 » Distance Approximating Trees: Complexity and Algorithms |
217
Voted
ACID
2006
15 years 4 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
349
Voted
ICDE
2000
IEEE
16 years 4 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...
147
Voted
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
14 years 10 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
131
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
141
click to vote
ICMCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...