Sciweavers

9886 search results - page 1391 / 1978
» Learning Compressible Models
Sort
View
CORR
2008
Springer
69views Education» more  CORR 2008»
15 years 7 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 7 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
AI
2006
Springer
15 years 7 months ago
Discovering the linear writing order of a two-dimensional ancient hieroglyphic script
This paper demonstrates how machine learning methods can be applied to deal with a realworld decipherment problem where very little background knowledge is available. The goal is ...
Shou de Lin, Kevin Knight
IJCV
2008
155views more  IJCV 2008»
15 years 7 months ago
Fast Transformation-Invariant Component Analysis
For software and more illustrations: http://www.psi.utoronto.ca/anitha/fastTCA.htm Dimensionality reduction techniques such as principal component analysis and factor analysis are...
Anitha Kannan, Nebojsa Jojic, Brendan J. Frey
JMLR
2008
83views more  JMLR 2008»
15 years 7 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
« Prev « First page 1391 / 1978 Last » Next »