Sciweavers

10901 search results - page 19 / 2181
» Approximations in Distributed Optimization
Sort
View
UAI
2001
15 years 3 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
148
Voted
FOCS
2004
IEEE
15 years 6 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
IROS
2007
IEEE
193views Robotics» more  IROS 2007»
15 years 8 months ago
Analyzing gaussian proposal distributions for mapping with rao-blackwellized particle filters
Abstract— Particle filters are a frequently used filtering technique in the robotics community. They have been successfully applied to problems such as localization, mapping, o...
Cyrill Stachniss, Giorgio Grisetti, Wolfram Burgar...
161
Voted
OL
2011
190views Neural Networks» more  OL 2011»
14 years 9 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
PE
2006
Springer
125views Optimization» more  PE 2006»
15 years 2 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot