Sciweavers

3780 search results - page 380 / 756
» Algorithms for Game Metrics
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 7 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
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 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...
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
16 years 1 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
MM
2009
ACM
138views Multimedia» more  MM 2009»
16 years 1 months ago
WOW: wild-open warning for broadcast basketball video based on player trajectory
In basketball games, wild-open means that there is an offensive player not well defended by his/her opponents. The occurrence of wild-open usually implies the existence of a succe...
Ming-Hsiu Chang, Ming-Chun Tien, Ja-Ling Wu
ATAL
2007
Springer
16 years 1 months ago
Children in the forest: towards a canonical problem of spatio-temporal collaboration
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
Yi Luo, Ladislau Bölöni