Sciweavers

228 search results - page 5 / 46
» Estimating Commit Sizes Efficiently
Sort
View
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 11 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
JOC
2010
82views more  JOC 2010»
13 years 2 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
AR
2008
118views more  AR 2008»
13 years 7 months ago
Efficient Behavior Learning Based on State Value Estimation of Self and Others
The existing reinforcement learning methods have been seriously suffering from the curse of dimension problem especially when they are applied to multiagent dynamic environments. ...
Yasutake Takahashi, Kentarou Noma, Minoru Asada
TCSV
2008
99views more  TCSV 2008»
13 years 7 months ago
Efficient Reference Frame Selector for H.264
This paper proposes a simple yet effective mechanism to select proper reference frames for H.264 motion estimation. Unlike traditional video codecs, H.264 permits more than one ref...
Tien-Ying Kuo, Hsin-Ju Lu
APWEB
2006
Springer
13 years 11 months ago
Sample Sizes for Query Probing in Uncooperative Distributed Information Retrieval
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...
Milad Shokouhi, Falk Scholer, Justin Zobel