Sciweavers

2638 search results - page 134 / 528
» Random Geometric Complexes
Sort
View
ICIP
1995
IEEE
16 years 6 months ago
On morphological openings and closings of signals in shaped noise
In recent work, we have shown that morphological openings and closings can be viewed as consistent MAP estimators of morphologically smooth binary image signals immersed in i.i.d....
Nikolaos Sidiropoulos, John S. Baras, Carlos Alber...
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 5 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
ICASSP
2009
IEEE
15 years 11 months ago
Joint reconstruction of compressed multi-view images
This paper proposes a distributed representation algorithm for multi-view images that are jointly reconstructed at the decoder. Compressed versions of each image are first obtain...
Xu Chen, Pascal Frossard
FOCS
2006
IEEE
15 years 10 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
COMPGEOM
2010
ACM
15 years 9 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton