Sciweavers

651 search results - page 102 / 131
» Index Sets and Universal Numberings
Sort
View
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
14 years 11 days ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
SLOGICA
2011
13 years 2 months ago
Logics for Qualitative Inductive Generalization
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
Diderik Batens
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
ASE
2010
86views more  ASE 2010»
13 years 8 months ago
Stable rankings for different effort models
There exists a large and growing number of proposed estimation methods but little conclusive evidence ranking one method over another. Prior effort estimation studies suffered fro...
Tim Menzies, Omid Jalali, Jairus Hihn, Daniel Bake...
FOCS
2010
IEEE
13 years 5 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan