Sciweavers

3694 search results - page 321 / 739
» Stochastic complexity in learning
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Learning sparse systems at sub-Nyquist rates: A frequency-domain approach
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse respo...
Martin McCormick, Yue M. Lu, Martin Vetterli
BDA
2007
15 years 8 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
AI
2010
Springer
15 years 6 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini
MTA
2006
173views more  MTA 2006»
15 years 6 months ago
Active learning in very large databases
Abstract. Query-by-example and query-by-keyword both suffer from the problem of "aliasing," meaning that example-images and keywords potentially have variable interpretat...
Navneet Panda, Kingshy Goh, Edward Y. Chang
AROBOTS
2002
91views more  AROBOTS 2002»
15 years 6 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro