Sciweavers

2103 search results - page 369 / 421
» Approximate Learning of Dynamic Models
Sort
View
SCALESPACE
2007
Springer
15 years 8 months ago
Towards Segmentation Based on a Shape Prior Manifold
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...
Patrick Etyngier, Renaud Keriven, Jean-Philippe Po...
ECML
2005
Springer
15 years 7 months ago
Using Rewards for Belief State Updates in Partially Observable Markov Decision Processes
Partially Observable Markov Decision Processes (POMDP) provide a standard framework for sequential decision making in stochastic environments. In this setting, an agent takes actio...
Masoumeh T. Izadi, Doina Precup
ISMIS
2003
Springer
15 years 7 months ago
Classifying Document Titles Based on Information Inference
We propose an intelligent document title classification agent based on a theory of information inference. The information is represented as vectorial spaces computed by a cognitive...
Dawei Song, Peter Bruza, Zi Huang, Raymond Y. K. L...
DIS
1998
Springer
15 years 6 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 5 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...