459 search results - page 24 / 92 » Computational Complexity of Probabilistic Disambiguation |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
104
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
126
click to vote
RECOMB
2003
Springer
16 years 2 days ago
2003
Springer
We develop an integrated probabilistic model to combine protein physical interactions, genetic interactions, highly correlated gene expression network, protein complex data, and d...
138
click to vote
IWCM
2004
Springer
15 years 5 months ago
2004
Springer
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
102
Voted
MICCAI
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Automatic delineation and robust measurement of fetal anatomical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, ...