Sciweavers

1451 search results - page 157 / 291
» Finding People by Sampling
Sort
View
155
Voted
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 6 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
JMLR
2008
79views more  JMLR 2008»
15 years 6 months ago
Manifold Learning: The Price of Normalization
We analyze the performance of a class of manifold-learning algorithms that find their output by minimizing a quadratic form under some normalization constraints. This class consis...
Yair Goldberg, Alon Zakai, Dan Kushnir, Yaacov Rit...
JSYML
2008
108views more  JSYML 2008»
15 years 6 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
JMLR
2006
113views more  JMLR 2006»
15 years 6 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...