471 search results - page 5 / 95 » On the Relative Dominance of Paging Algorithms |
161
Voted
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
126
Voted
ICML
2000
IEEE
16 years 4 months ago
2000
IEEE
Machine learning typically involves discovering regularities in a training set, then applying these learned regularities to classify objects in a test set. In this paper we presen...
52
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The dominance relationship between two members of the family of Sugeno Weber tnorms is proven by using a quantifer elimination algorithm. Further it is shown that dominan...
170
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
124
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...