459 search results - page 21 / 92 » Computational Complexity of Probabilistic Disambiguation |
156
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
The Grid technology is evolving into a global, service-orientated architecture – a universal platform for delivering future high demand computational services. Strong adoption of...
122
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...
147
click to vote
ECML
2007
Springer
15 years 11 months ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
136
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
173
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...