492 search results - page 25 / 99 » The number of possibilities for random dating |
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
RSA
2008
14 years 9 months ago
2008
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
111
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...