1262 search results - page 128 / 253 » Fast Robust Hashing |
243
click to vote
FAST
2011
14 years 6 months ago
2011
We present Anticipatory Memory Allocation (AMA), a new method to build kernel code that is robust to memoryallocation failures. AMA avoids the usual difficulties in handling allo...
121
click to vote
CHES
2009
Springer
16 years 3 months ago
2009
Springer
We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data- and key-dependent branches and mem...
213
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
125
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
141
click to vote
WIDM
2004
ACM
15 years 8 months ago
2004
ACM
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...