4171 search results - page 269 / 835 » Choice numbers of graphs |
165
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
170
click to vote
APPROX
2004
Springer
16 years 5 days ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
154
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
Increased AP density in enterprise WLANs leads to increasing RF interference and decreasing performance. An important step towards mitigating this problem is to construct precise ...
227
click to vote
LOGCOM
1998
15 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
199
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...