Sciweavers

451 search results - page 1 / 91
» Relationless Completeness and Separations
Sort
View
COCO
2010
Springer
136views Algorithms» more  COCO 2010»
14 years 2 months ago
Relationless Completeness and Separations
Pavel Hrubes, Avi Wigderson, Amir Yehudayoff
TASLP
2011
13 years 5 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
STACS
2010
Springer
14 years 5 months ago
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
TASLP
2010
138views more  TASLP 2010»
13 years 5 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
SEFM
2009
IEEE
14 years 5 months ago
Completeness of Pointer Program Verification by Separation Logic
Makoto Tatsuta, Wei-Ngan Chin, Mahmudul Faisal Al ...