545 search results - page 8 / 109 » Estimating the Probability of Approximate Matches |
HEURISTICS
2002
13 years 7 months ago
2002
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
PAMI
2006
13 years 7 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
IQ
2003
13 years 8 months ago
2003
We introduce ClueMaker, the first language designed specifically for approximate record matching. Clues written in ClueMaker predict whether two records denote the same thing based...
ICDE
2006
IEEE
14 years 8 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...