Sciweavers

358 search results - page 42 / 72
» Rank Matrix Factorisation
Sort
View
CORR
2010
Springer
93views Education» more  CORR 2010»
14 years 11 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
101
Voted
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 3 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
ICML
2006
IEEE
15 years 11 months ago
Bayesian learning of measurement and structural models
We present a Bayesian search algorithm for learning the structure of latent variable models of continuous variables. We stress the importance of applying search operators designed...
Ricardo Silva, Richard Scheines
NICSO
2010
Springer
15 years 2 months ago
Accelerated Genetic Algorithms with Markov Chains
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
Guan Wang, Chen Chen, Kwok Yip Szeto
82
Voted
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 11 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht