Sciweavers

470 search results - page 85 / 94
» Reading a Neural Code
Sort
View
IJON
2007
88views more  IJON 2007»
14 years 11 months ago
Information maximization in face processing
This perspective paper explores principles of unsupervised learning and how they relate to face recognition. Dependency coding and information maximization appear to be central pr...
Marian Stewart Bartlett
NECO
2007
127views more  NECO 2007»
14 years 11 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
POPL
2008
ACM
16 years 2 days ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
CADE
2001
Springer
16 years 2 days ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 2 days ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur