Sciweavers

580 search results - page 83 / 116
» Choosing a random peer
Sort
View
DSN
2009
IEEE
15 years 6 months ago
Verme: Worm containment in overlay networks
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they h...
Filipe Freitas, Edgar Marques, Rodrigo Rodrigues, ...
ICDM
2009
IEEE
164views Data Mining» more  ICDM 2009»
15 years 6 months ago
iTopicModel: Information Network-Integrated Topic Modeling
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...
Yizhou Sun, Jiawei Han, Jing Gao, Yintao Yu
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
15 years 6 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 6 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
MSWIM
2004
ACM
15 years 5 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman