Sciweavers

365 search results - page 42 / 73
» Weight properties of network codes
Sort
View
WWW
2011
ACM
13 years 3 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
IPSN
2005
Springer
14 years 2 months ago
Avrora: scalable sensor network simulation with precise timing
— Simulation can be an important step in the development of software for wireless sensor networks and has been the subject of intense research in the past decade. While most prev...
Ben Titzer, Daniel K. Lee, Jens Palsberg
SIGCOMM
2003
ACM
14 years 1 months ago
Network routing with path vector protocols: theory and applications
Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In th...
João L. Sobrinho
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 3 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...