3008 search results - page 159 / 602 » Independence in connected graphs |
275
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
183
click to vote
WINET
2010
15 years 4 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
194
click to vote
ACSAC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
176
click to vote
ITA
2006
15 years 6 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
160
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...