Sciweavers

1261 search results - page 115 / 253
» Approximation algorithms for aligning points
Sort
View
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
14 years 11 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
IROS
2006
IEEE
103views Robotics» more  IROS 2006»
15 years 4 months ago
Trinocular Spherical Stereo
–In contrast with the conventional trinocular planar image stereo in which the third camera is usually used to reduce the ambiguity on matching, every spherical camera of trinocu...
Shigang Li
FOCS
2006
IEEE
15 years 4 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
GLOBECOM
2007
IEEE
15 years 4 months ago
Capacity and Fairness of MIMO Broadcast Algorithms in Shadow Fading Environments
Abstract— For MIMO broadcast systems the effects of shadowing on the channel capacity and the fairness of the system in sharing the resources amongst multiple users are important...
Timothy W. King, Peter J. Smith, Lee M. Garth
ECCV
2010
Springer
15 years 3 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...