Sciweavers

1261 search results - page 56 / 253
» Approximation algorithms for aligning points
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ICCV
2009
IEEE
16 years 11 months ago
Shape-based Recognition of 3D Point Clouds in Urban Environments
This paper investigates the design of a system for recognizing objects in 3D point clouds of urban environments. The system is decomposed into four steps: locating, segmenting, ...
Aleksey Golovinskiy, Vladimir G. Kim, Thomas Funkh...
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 6 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 6 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk