Sciweavers

146 search results - page 2 / 30
» Independence Assumptions Considered Harmful
Sort
View
CIE
2008
Springer
13 years 7 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
JMLR
2006
103views more  JMLR 2006»
13 years 5 months ago
Pattern Recognition for Conditionally Independent Data
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
Daniil Ryabko
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
13 years 9 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
DAGSTUHL
2007
13 years 6 months ago
Premise Independence in Judgment Aggregation
Judgment aggregation studies how agent opinions on logically interconnected propositions can be mapped into a collective judgment on the same propositions, and is plagued by impos...
Gabriella Pigozzi, Leendert van der Torre
TARK
2005
Springer
13 years 10 months ago
Order independence and rationalizability
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of...
Krzysztof R. Apt