Sciweavers

2835 search results - page 280 / 567
» Automatic Question Answering
Sort
View
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
16 years 1 months ago
The role of game theory in human computation systems
The paradigm of “human computation” seeks to harness human abilities to solve computational problems or otherwise perform distributed work that is beyond the scope of current ...
Shaili Jain, David C. Parkes
STACS
2009
Springer
16 years 1 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
LICS
2009
IEEE
16 years 1 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
182
Voted
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
16 years 1 months ago
Strong Parallel Repetition Theorem for Free Projection Games
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
16 years 1 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità