1051 search results - page 49 / 211 » On the Correspondence between Approximations and Similarity |
298
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
178
click to vote
WADS
2007
Springer
16 years 8 days ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
183
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
215
click to vote
TIFS
2008
15 years 6 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
141
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...