827 search results - page 67 / 166 » The Complexity of Probabilistic Lobbying |
160
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
210
click to vote
UAI
1997
15 years 7 months ago
1997
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
172
click to vote
PRIS
2001
15 years 7 months ago
2001
This paper addresses the problem of tracking objects with complex motion dynamics or shape changes. It is assumed that some of the visual features detected in the image (e.g., edg...
144
click to vote
AIPS
2000
15 years 7 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
156
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...