Sciweavers

534 search results - page 34 / 107
» Power from Random Strings
Sort
View
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
14 years 4 months ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
14 years 4 months ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
LICS
2010
IEEE
13 years 9 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
ISQED
2009
IEEE
133views Hardware» more  ISQED 2009»
14 years 5 months ago
A novel ACO-based pattern generation for peak power estimation in VLSI circuits
Estimation of maximal power consumption is an essential task in VLSI circuit realizations since power value significantly affects the reliability of the circuits. The key issue o...
Yi-Ling Liu, Chun-Yao Wang, Yung-Chih Chen, Ya-Hsi...
ICIP
2010
IEEE
13 years 9 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao