2489 search results - page 135 / 498 » On the Subgroup Distance Problem |
157
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
123
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Shape warping is a key problem in statistical shape analysis. This paper proposes a framework for geometric shape warping based on both shape distances and landmarks. Our method i...
133
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
128
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
106
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...