Sciweavers

2478 search results - page 34 / 496
» Universality in two dimensions
Sort
View
CISS
2008
IEEE
16 years 16 days ago
Fusion frames and robust dimension reduction
Abstract— We consider the linear minimum meansquared error (LMMSE) estimation of a random vector of interest from its fusion frame measurements in presence noise and subspace era...
Ali Pezeshki, Gitta Kutyniok, A. Robert Calderbank
ICDCS
2006
IEEE
16 years 3 days ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
15 years 11 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
COMPGEOM
2004
ACM
15 years 11 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
COMPGEOM
2010
ACM
15 years 11 months ago
On the complexity of sets of free lines and line segments among balls in three dimensions
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
Marc Glisse, Sylvain Lazard