817 search results - page 96 / 164 » Robust Euclidean embedding |
138
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
117
Voted
CVPR
2010
IEEE
16 years 2 days ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
172
Voted
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
From an image we construct an invertible orientation score, which provides an overview of local orientations in an image. This orientation score is a function on the group SE(2) of...
175
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
126
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...