1256 search results - page 214 / 252 » Experiences with the DEVStone benchmark |
SIGSOFT
2002
ACM
14 years 11 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
WWW
2006
ACM
14 years 11 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
PPOPP
2009
ACM
14 years 11 months ago
2009
ACM
Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multi...
KDD
2009
ACM
14 years 11 months ago
2009
ACM
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...