1351 search results - page 35 / 271 » Learning from compressed observations |
113
click to vote
ICML
2001
IEEE
16 years 1 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
99
Voted
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— In this paper, we present a weighted Linde-BuzoGray algorithm (WLBG) as a powerful and efficient technique for compressing neural spike data. We compare this technique...
100
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
131
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present an on-line learning framework tailored towards real-time learning from observed user behavior in search engines and other information retrieval systems. In particular, ...
131
Voted
ICCV
2011
IEEE
14 years 20 days ago
2011
IEEE
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...