Sciweavers

144 search results - page 8 / 29
» Improved Approximation Guarantees for Sublinear-Time Fourier...
Sort
View
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 9 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
ATAL
2007
Springer
14 years 1 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
INFOCOM
2009
IEEE
14 years 2 months ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
WINE
2007
Springer
161views Economy» more  WINE 2007»
14 years 1 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 7 days ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan