Sciweavers

10909 search results - page 399 / 2182
» Evaluating Backup Algorithms
Sort
View
ICIP
2009
IEEE
16 years 7 months ago
Early Terminating Algorithms For Adaboost Based Detectors
In this paper we propose an early termination algorithm for speeding up the detection phase of the Adaboost based detectors. In the basic algorithm, at a specific search location,...
ICML
2004
IEEE
16 years 7 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
VLDB
2009
ACM
159views Database» more  VLDB 2009»
16 years 7 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
INFOCOM
2009
IEEE
16 years 1 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
ATAL
2009
Springer
16 years 1 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh