Sciweavers

497 search results - page 27 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Interpolation based on stationary and adaptive AR(1) modeling
In this paper, we describe a minimal mean square error (MMSE) optimal interpolation filter for discrete random signals. We explicitly derive the interpolation filter for a firs...
Eija Johansson, Marie Strom, Mats Viberg, Lennart ...
AAAI
2006
14 years 11 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
IAT
2006
IEEE
15 years 3 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
DAC
2009
ACM
15 years 10 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
NIPS
2007
14 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola