Sciweavers

251 search results - page 12 / 51
» On the Complexity of Learning Lexicographic Strategies
Sort
View
ICCBR
1997
Springer
14 years 2 months ago
Merge Strategies for Multiple Case Plan Replay
Planning by analogical reasoning is a learning method that consists of the storage, retrieval, and replay of planning episodes. Planning performance improves with the accumulationa...
Manuela M. Veloso
AAAI
1993
13 years 11 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
ICML
2007
IEEE
14 years 11 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
MM
2003
ACM
239views Multimedia» more  MM 2003»
14 years 3 months ago
Foreground object detection from videos containing complex background
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
Liyuan Li, Weimin Huang, Irene Y. H. Gu, Qi Tian
SIGDIAL
2010
13 years 8 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...