1806 search results - page 324 / 362 » Randomness and halting probabilities |
CRYPTO
2008
Springer
15 years 1 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
103
click to vote
DIMVA
2007
15 years 1 months ago
2007
Abstract. We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (ratebased sequential hy...
111
click to vote
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
116
click to vote
CRYPTO
2010
Springer
15 years 28 days ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
100
click to vote
BMCBI
2007
14 years 12 months ago
2007
Background: Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degr...