Sciweavers

1261 search results - page 120 / 253
» Approximation algorithms for aligning points
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
COMPGEOM
1996
ACM
15 years 2 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
CVPR
2012
IEEE
13 years 10 days ago
A fast nearest neighbor search algorithm by nonlinear embedding
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...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
CAE
2007
15 years 10 days ago
Stipple Placement using Distance in a Weighted Graph
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...
David Mould
JCC
2002
73views more  JCC 2002»
14 years 9 months ago
Linear scaling approaches to quantum macromolecular similarity: Evaluating the similarity function
: The evaluation of the electron density based similarity function scales quadratically with respect to the size of the molecules for simplified, atomic shell densities. Due to the...
Pere Constans