Sciweavers

932 search results - page 28 / 187
» Uniform Random Number Generators
Sort
View
JAIR
2002
182views more  JAIR 2002»
14 years 9 months ago
An Analysis of Phase Transition in NK Landscapes
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
Yong Gao, Joseph C. Culberson
INFOCOM
2011
IEEE
14 years 1 months ago
Fast and scalable secret key generation exploiting channel phase randomness in wireless networks
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
Qian Wang, Hai Su, Kui Ren, Kwangjo Kim
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
15 years 3 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
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 9 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 7 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki