1431 search results - page 20 / 287 » The complexity of random ordered structures |
ITSL
2008
14 years 11 months ago
2008
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
CHES
2010
Springer
14 years 10 months ago
2010
Springer
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
71
Voted
KDD
1998
ACM
15 years 1 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
TSP
2011
14 years 4 months ago
2011
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
105
click to vote
CCR
2004
14 years 9 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...