471 search results - page 5 / 95 » On the Relative Dominance of Paging Algorithms |
108
click to vote
MOBIHOC
2002
ACM
15 years 9 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...
ICML
2000
IEEE
15 years 10 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...
CORR
2010
Springer
14 years 10 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...
103
click to vote
ALGORITHMICA
2006
14 years 9 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...
SDM
2007
SIAM
14 years 11 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...