6404 search results - page 21 / 1281 » To Block or Not to Block |
170
click to vote
ISPD
1998
ACM
15 years 9 months ago
1998
ACM
In this paper, we formulate the problem of topology constrained rectilinear block packing in layout reuse. A speci c class of rectilinear shaped blocks, ordered convex rectilinear...
144
Voted
ESA
2001
Springer
15 years 9 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
157
click to vote
JOC
1998
15 years 5 months ago
1998
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
133
click to vote
CHES
2007
Springer
15 years 11 months ago
2007
Springer
With the establishment of the AES the need for new block ciphers has been greatly diminished; for almost all block cipher applications the AES is an excellent and preferred choice....
158
Voted
AAAI
2006
15 years 6 months ago
2006
Record linkage is the process of matching records across data sets that refer to the same entity. One issue within record linkage is determining which record pairs to consider, si...