63 search results - page 8 / 13 » Transparent pointer compression for linked data structures |
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
SEMWEB
2007
Springer
15 years 5 months ago
2007
Springer
Revyu.com is a live, publicly accessible reviewing and rating Web site, designed to be usable by humans whilst transparently generating machinereadable RDF metadata for the Semanti...
SIGMETRICS
2004
ACM
15 years 5 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
MM
1995
ACM
15 years 3 months ago
1995
ACM
The current model for multicast transmission of video over the Internet assumes that a fixed average bandwidth is uniformly present throughout the network. Consequently, sources ...
106
Voted
CASES
2006
ACM
15 years 5 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...