Sciweavers

5580 search results - page 906 / 1116
» Randomized priority algorithms
Sort
View
CCS
2003
ACM
15 years 7 months ago
Cryptographic tamper evidence
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
Gene Itkis
96
Voted
ICALP
2010
Springer
15 years 7 months ago
Tight Thresholds for Cuckoo Hashing via XORSAT
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...
Martin Dietzfelbinger, Andreas Goerdt, Michael Mit...
127
Voted
GECCO
2009
Springer
15 years 6 months ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
102
Voted
SIGGRAPH
1994
ACM
15 years 6 months ago
Frameless rendering: double buffering considered harmful
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...
Gary Bishop, Henry Fuchs, Leonard McMillan, Ellen ...
ACNS
2004
Springer
85views Cryptology» more  ACNS 2004»
15 years 6 months ago
CamouflageFS: Increasing the Effective Key Length in Cryptographic Filesystems on the Cheap
One of the few quantitative metrics used to evaluate the security of a cryptographic file system is the key length of the encryption algorithm; larger key lengths correspond to hig...
Michael E. Locasto, Angelos D. Keromytis