Sciweavers

3875 search results - page 87 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
ICASSP
2011
IEEE
13 years 18 days ago
Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
Shubha Shedthikere, Ananthanarayanan Chockalingam
STACS
2010
Springer
13 years 6 months ago
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
Leah Epstein, Asaf Levin, Julián Mestre, Da...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 9 months ago
Improved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
James King, David G. Kirkpatrick
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 9 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
ISITA
2010
13 years 6 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...