Sciweavers

265 search results - page 40 / 53
» A Scheme for Approximating Probabilistic Inference
Sort
View
ALT
2004
Springer
14 years 5 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
AI
2011
Springer
13 years 3 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
PAMI
2010
205views more  PAMI 2010»
13 years 7 months ago
Learning a Hierarchical Deformable Template for Rapid Deformable Object Parsing
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
Long Zhu, Yuanhao Chen, Alan L. Yuille
IMR
2004
Springer
14 years 2 months ago
Identification and Preservation of Surface Features
A surface is often approximated by a network of triangular facets. In the absence of a precise mathematical description of the underlying surface all information about surface pro...
Timothy J. Baker
ICPR
2002
IEEE
14 years 9 months ago
Bayesian Networks as Ensemble of Classifiers
Classification of real-world data poses a number of challenging problems. Mismatch between classifier models and true data distributions on one hand and the use of approximate inf...
Ashutosh Garg, Vladimir Pavlovic, Thomas S. Huang