Sciweavers

1082 search results - page 38 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
ARITH
1999
IEEE
13 years 12 months ago
Complex Logarithmic Number System Arithmetic Using High-Radix Redundant CORDIC Algorithms
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...
David Lewis
ICCV
2009
IEEE
15 years 18 days 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»
13 years 7 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»
14 years 8 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