Sciweavers

1503 search results - page 209 / 301
» Generalized Parity Games
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 11 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 11 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
CHI
2004
ACM
14 years 11 months ago
Objectively evaluating entertainment technology
Emerging technologies offer new ways of using entertainment technology to foster interactions between players and connect people. Evaluating entertainment technology is challengin...
Regan L. Mandryk
GLOBECOM
2009
IEEE
14 years 5 months ago
PEMP: Peering Equilibrium MultiPath Routing
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
Stefano Secci, Jean-Louis Rougier, Achille Pattavi...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 5 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...