Sciweavers

493 search results - page 29 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
ACCV
2007
Springer
14 years 2 months ago
Learning a Fast Emulator of a Binary Decision Process
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
Jan Sochman, Jiri Matas
TNN
2008
178views more  TNN 2008»
13 years 8 months ago
IMORL: Incremental Multiple-Object Recognition and Localization
This paper proposes an incremental multiple-object recognition and localization (IMORL) method. The objective of IMORL is to adaptively learn multiple interesting objects in an ima...
Haibo He, Sheng Chen
JAIR
2011
144views more  JAIR 2011»
13 years 3 months ago
Non-Deterministic Policies in Markovian Decision Processes
Markovian processes have long been used to model stochastic environments. Reinforcement learning has emerged as a framework to solve sequential planning and decision-making proble...
Mahdi Milani Fard, Joelle Pineau
PAMI
2011
13 years 3 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
COLT
1998
Springer
14 years 29 days ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer