1510 search results - page 194 / 302 » Upper Probabilities and Additivity |
149
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
149
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
163
click to vote
NIPS
2000
15 years 5 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
127
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
144
click to vote
AUTOMATICA
2007
15 years 4 months ago
2007
In this paper, the problem of decentralized adaptive output-feedback stabilization is investigated for large-scale stochastic nonlinear systems with three types of uncertainties, ...