Sciweavers

1457 search results - page 46 / 292
» On the Uniform Distribution of Strings
Sort
View
ECCC
2000
93views more  ECCC 2000»
15 years 5 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
FCCM
2006
IEEE
138views VLSI» more  FCCM 2006»
15 years 9 months ago
Efficient Hardware Generation of Random Variates with Arbitrary Distributions
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
David B. Thomas, Wayne Luk
CEC
2008
IEEE
16 years 11 days ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 12 months ago
An Encrypted, Content Searchable Scalable Distributed Data Structure
Scalable Distributed Data Structures (SDDS) store data in a file of key-based records distributed over many storage sites. The number of storage sites utilized grows and shrinks w...
Thomas J. E. Schwarz, Peter Tsui, Witold Litwin
ITRUST
2004
Springer
15 years 11 months ago
Pinocchio: Incentives for Honest Participation in Distributed Trust Management
Abstract. In this paper, we introduce a framework for providing incentives for honest participation in global-scale distributed trust management infrastructures. Our system can imp...
Alberto Fernandes, Evangelos Kotsovinos, Sven &Oum...