1254 search results - page 250 / 251 » Making Hard Problems Harder |
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
EUROSYS
2007
ACM
14 years 4 months ago
2007
ACM
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...