Sciweavers

104 search results - page 16 / 21
» Nodes of large degree in random trees and forests
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 10 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
VLDB
2005
ACM
144views Database» more  VLDB 2005»
14 years 2 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
INFOCOM
2002
IEEE
14 years 1 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
INFOCOM
2006
IEEE
14 years 2 months ago
Accelerating Simulation of Large-Scale IP Networks: A Network Invariant Preserving Approach
— In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP netwo...
Hwangnam Kim, Hyuk Lim, Jennifer C. Hou
INFOCOM
2005
IEEE
14 years 2 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...