1017 search results - page 55 / 204 » Some existence and construction results of polygonal designs |
102
click to vote
ISMB
1993
15 years 1 months ago
1993
Interactions that determinecellular fate are exceedingly complex, can take place at different levels of gene regulation and involve a large numberof components(such as genes, prot...
127
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
ASIACRYPT
2007
Springer
15 years 6 months ago
2007
Springer
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
DCC
2005
IEEE
15 years 11 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
110
click to vote
STOC
2003
ACM
16 years 4 days ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...