Sciweavers

2183 search results - page 27 / 437
» Multi-pass geometric algorithms
Sort
View
CCCG
2010
13 years 11 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
COMGEO
2004
ACM
13 years 9 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
PIMRC
2010
IEEE
13 years 7 months ago
Making multiuser MIMO work for LTE
Underlining the viability of multiuser (MU) MIMO for future wireless communications as long term evolution (LTE), we propose in this paper a precoding strategy based on the low res...
Rizwan Ghaffar, Raymond Knopp
ICASSP
2011
IEEE
13 years 1 months ago
Approximation of pattern transformation manifolds with parametric dictionaries
The construction of low-dimensional models explaining highdimensional signal observations provides concise and efficient data representations. In this paper, we focus on pattern ...
Elif Vural, Pascal Frossard
CVIU
2007
120views more  CVIU 2007»
13 years 9 months ago
A comparison of Gaussian and mean curvature estimation methods on triangular meshes of range image data
Estimating intrinsic geometric properties of a surface from a polygonal mesh obtained from range data is an important stage of numerous algorithms in computer and robot vision, co...
Evgeni Magid, Octavian Soldea, Ehud Rivlin