2423 search results - page 263 / 485 » AnswerArt - Contextualized Question Answering |
174
Voted
ECCC
2010
15 years 6 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
161
click to vote
EC
2008
15 years 6 months ago
2008
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...
159
click to vote
AIS
2006
Springer
15 years 6 months ago
2006
Springer
Artificial intelligence researchers interested in knowledge and in designing and implementing digitized artifacts for representing or sharing knowledge play a crucial role in the ...
178
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
184
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...