Sciweavers

8699 search results - page 227 / 1740
» Elements of the Theory of Computation
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
Rosa I. Arriaga, Santosh Vempala
CIKM
1997
Springer
15 years 10 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
ECCV
2006
Springer
15 years 10 months ago
Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm
We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (lowresolution) im...
Hui Ji, Cornelia Fermüller
ICCV
1995
IEEE
15 years 10 months ago
A Theory of Specular Surface Geometry
Atheoreticalframeworkisintroducedfortheperceptionofspecularsurfacegeometry.Whenanobserver moves in three-dimensional space, real scene features such as surface markings remain stat...
Michael Oren, Shree K. Nayar
NIPS
2008
15 years 8 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie