Sciweavers

2835 search results - page 311 / 567
» Automatic Question Answering
Sort
View
ECCC
2010
78views more  ECCC 2010»
15 years 6 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
174
Voted
ECCC
2010
82views more  ECCC 2010»
15 years 6 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
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...
Ran Raz
EC
2008
103views ECommerce» more  EC 2008»
15 years 6 months ago
A Graphical Model for Evolutionary Optimization
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...
Christopher K. Monson, Kevin D. Seppi
AIS
2006
Springer
15 years 6 months ago
Computers and knowledge: a dialogical approach
Artificial intelligence researchers interested in knowledge and in designing and implementing digitized artifacts for representing or sharing knowledge play a crucial role in the ...
Christian Brassac
CC
2006
Springer
125views System Software» more  CC 2006»
15 years 6 months ago
A tight lower bound for restricted pir protocols
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...
Richard Beigel, Lance Fortnow, William I. Gasarch