3202 search results - page 231 / 641 » Memory access scheduling |
172
click to vote
SAINT
2005
IEEE
15 years 11 months ago
2005
IEEE
The volume of mass unsolicited electronic mail, often known as spam, has recently increased enormously and has become a serious threat to not only the Internet but also to society...
162
click to vote
WMPI
2004
ACM
15 years 11 months ago
2004
ACM
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
198
click to vote
ADC
2000
Springer
15 years 10 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
171
click to vote
ICNP
1999
IEEE
15 years 10 months ago
1999
IEEE
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
167
click to vote
ESORICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. While processor based systems often enforce memory protection to prevent the unintended sharing of data between processes, current systems built around reconfigurable har...