1053 search results - page 103 / 211 » Shape as Memory Storage |
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...
EUROMICRO
2002
IEEE
15 years 2 months ago
2002
IEEE
Internet services like the world-wide web and multimedia applications like News- and Video-on-Demand have become very popular over the last years. Due to the large number of users ...
HPCA
1996
IEEE
15 years 2 months ago
1996
IEEE
Traditional DMA requires the operating system to perform many tasks to initiate a transfer, with overhead on the order of hundreds or thousands of CPU instructions. This paper des...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
ASPLOS
2008
ACM
14 years 12 months ago
2008
ACM
Many hardware optimizations rely on collecting information about program behavior at runtime. This information is stored in lookup tables. To be accurate and effective, these opti...