Sciweavers

1845 search results - page 216 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
JMLR
2010
109views more  JMLR 2010»
13 years 3 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
WEBI
2009
Springer
14 years 2 months ago
Rigorous Probabilistic Trust-Inference with Applications to Clustering
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
AAAI
1992
13 years 9 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 8 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
CISS
2011
IEEE
13 years 3 days ago
The Restricted Isometry Property for block diagonal matrices
—In compressive sensing (CS), the Restricted Isometry Property (RIP) is a powerful condition on measurement operators which ensures robust recovery of sparse vectors is possible ...
Han Lun Yap, Armin Eftekhari, Michael B. Wakin, Ch...