Sciweavers

83 search results - page 8 / 17
» A Comparison of Approaches for Learning Probability Trees
Sort
View
62
Voted
ML
2002
ACM
135views Machine Learning» more  ML 2002»
15 years 2 days ago
Bayesian Treed Models
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
Hugh A. Chipman, Edward I. George, Robert E. McCul...
107
Voted
RAS
2010
117views more  RAS 2010»
14 years 10 months ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
94
Voted
CVPR
2001
IEEE
16 years 2 months ago
Learning Models for Object Recognition
We consider learning models for object recognition from examples. Our method is motivated by systems that use the Hausdorff distance as a shape comparison measure. Typically an ob...
Pedro F. Felzenszwalb
AI
2010
Springer
15 years 16 days ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
108
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Occlusion-based depth ordering on monocular images with Binary Partition Tree
This paper proposes a system to relate objects in an image using occlusion cues and arrange them according to depth. The system does not rely on any a priori knowledge of the scen...
Guillem Palou, Philippe Salembier