1100 search results - page 94 / 220 » Approximate distance oracles |
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
SODA
2001
ACM
14 years 11 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 ...
ALGORITHMICA
2005
14 years 10 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
118
click to vote
TIFS
2008
14 years 10 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...
JCC
2002
14 years 9 months ago
2002
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...