350 search results - page 29 / 70 » Approximation Algorithms for Unique Games |
161
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
111
Voted
WINE
2010
Springer
15 years 10 days ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
167
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
103
Voted
AMC
2008
15 years 2 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
105
click to vote
ICASSP
2009
IEEE
15 years 8 days ago
2009
IEEE
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...