827 search results - page 22 / 166 » The Complexity of Probabilistic Lobbying |
108
click to vote
TSP
2008
15 years 1 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
136
click to vote
DAGM
2001
Springer
15 years 6 months ago
2001
Springer
Vision systems for service robotics applications have to cope with varying environmental conditions, partial occlusions, complex backgrounds and a large number of distractors (clut...
118
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
118
Voted
AAAI
2008
15 years 4 months ago
2008
Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...
UAI
1996
15 years 3 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...