Sciweavers

1511 search results - page 73 / 303
» Randomness, lowness and degrees
Sort
View
MICS
2010
134views more  MICS 2010»
14 years 10 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
CHES
2011
Springer
276views Cryptology» more  CHES 2011»
13 years 12 months ago
FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control
Abstract. The paper presents a novel and efficient method to generate true random numbers on FPGAs by inducing metastability in bi-stable circuit elements, e.g. flip-flops. Meta...
Mehrdad Majzoobi, Farinaz Koushanfar, Srinivas Dev...
ICSE
2007
IEEE-ACM
15 years 12 months ago
Randomized Differential Testing as a Prelude to Formal Verification
Most flight software testing at the Jet Propulsion Laboratory relies on the use of hand-produced test scenarios and is executed on systems as similar as possible to actual mission...
Alex Groce, Gerard J. Holzmann, Rajeev Joshi
OPODIS
2004
15 years 1 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
AOSD
2007
ACM
15 years 3 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen