132 search results - page 12 / 27 » Context-specific approximation in probabilistic inference |
120
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
ICMLA
2008
15 years 1 months ago
2008
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
109
click to vote
IJCAI
1997
15 years 1 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
135
click to vote
IJCAI
1997
15 years 1 months ago
1997
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
114
click to vote
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...