4850 search results - page 837 / 970 » Approximate Data Structures with Applications |
106
click to vote
PDCN
2004
14 years 11 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
169
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
IEEECIT
2009
IEEE
15 years 4 months ago
2009
IEEE
—With virtual machine technology, distributed services deployed in multiple cooperative virtual machines, such as multi-tier web services, may reside on one physical machine. Thi...
ICDCS
2006
IEEE
15 years 4 months ago
2006
IEEE
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...