Sciweavers

27 search results - page 1 / 6
» Microlocal Analysis of the Geometric Separation Problem
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 4 months ago
Microlocal Analysis of the Geometric Separation Problem
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
David L. Donoho, Gitta Kutyniok
ICA
2007
Springer
13 years 10 months ago
On Separation of Signal Sources Using Kernel Estimates of Probability Densities
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
Oleg V. Michailovich, Douglas Wiens
RECOMB
2001
Springer
14 years 5 months ago
Geometric algorithms for the analysis of 2D-electrophoresis gels
In proteomics 2?dimensional gel electrophoresis (2?DE) is a separation technique for proteins. The resulting protein spots can be identified by either using picking robots and sub...
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christo...
SAC
2006
ACM
13 years 10 months ago
Spatial geometric constraint solving based on k-connected graph decomposition
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
Gui-Fang Zhang, Xiao-Shan Gao
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 4 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani