Sciweavers

683 search results - page 14 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
ICA
2010
Springer
15 years 4 months ago
Adaptive Underdetermined ICA for Handling an Unknown Number of Sources
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
Andreas Sandmair, Alam Zaib, Fernando Puente Le&oa...
200
Voted
TITB
2002
172views more  TITB 2002»
15 years 3 months ago
Shape recovery algorithms using level sets in 2-D/3-D medical imagery: a state-of-the-art review
The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape r...
Jasjit S. Suri, Kecheng Liu, Sameer Singh, Swamy L...
128
Voted
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 3 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
IVC
2007
102views more  IVC 2007»
15 years 3 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
149
Voted
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 3 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...