Sciweavers

129 search results - page 6 / 26
» Matrix Decomposition Problem Is Complete for the Average Cas...
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 6 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
ICASSP
2010
IEEE
13 years 7 months ago
Collaborative spectrum sensing from sparse observations using matrix completion for cognitive radio networks
— In cognitive radio, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognit...
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, Zh...
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
FLAIRS
2003
13 years 8 months ago
Efficient Retrieval for Case-Based Reasoning
In this work two indexing approaches are presented for case-based reasoning. The first is a hybrid technique which uses a combination of a matrix structure and a tree structure to...
David W. Patterson, Niall Rooney, Mykola Galushka