245 search results - page 5 / 49 » Introducing the User-over-Ranking Hypothesis |
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
80
Voted
ISITA
2010
14 years 7 months ago
2010
A new lossless data compression technique called compression via substring enumeration (CSE) has recently been introduced. It has been observed that CSE achieves lower performance ...
ICIP
2008
IEEE
15 years 4 months ago
2008
IEEE
We present the results of a systematic study of the contextual gain hypothesis for image classification. This hypothesis relates the traditional strategy of direct visual classi...
ICASSP
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...