804 search results - page 26 / 161 » On the Termination of the Chase Algorithm |
69
Voted
SIGMETRICS
1998
ACM
15 years 2 months ago
1998
ACM
This paper presents cooperative prefetching and caching — the use of network-wide global resources (memories, CPUs, and disks) to support prefetching and caching in the presence...
73
Voted
WWW
2007
ACM
2007
ACM
Robust web page segmentation for mobile terminal using content-distances and page layout information
15 years 11 months ago
The demand of browsing information from general Web pages using a mobile phone is increasing. However, since the majority of Web pages on the Internet are optimized for browsing f...
ICISC
2009
14 years 8 months ago
2009
Abstract. The design of embedded processors demands a careful tradeoff between many conflicting objectives such as performance, silicon area and power consumption. Finding such a t...
ESA
2008
Springer
14 years 12 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...