Sciweavers

1163 search results - page 187 / 233
» Concurrent Subspaces Analysis
Sort
View
113
Voted
ALT
2003
Springer
15 years 7 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
127
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
138
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 3 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
144
Voted
SIAMCO
2008
130views more  SIAMCO 2008»
15 years 3 months ago
Important Moments in Systems and Control
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
Christopher I. Byrnes, Anders Lindquist
146
Voted
IJCV
2010
169views more  IJCV 2010»
15 years 2 months ago
Rigid Structure from Motion from a Blind Source Separation Perspective
We present an information theoretic approach to define the problem of structure from motion (SfM) as a blind source separation one. Given that for almost all practical joint densi...
Jeff Fortuna, Aleix M. Martínez