Sciweavers

365 search results - page 53 / 73
» Weight properties of network codes
Sort
View
IWDC
2001
Springer
101views Communications» more  IWDC 2001»
14 years 1 months ago
Resource Stealing in Endpoint Controlled Multi-class Networks
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...
Susana Sargento, Rui Valadas, Edward W. Knightly
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 9 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
INFOSCALE
2006
ACM
14 years 2 months ago
Simulating non-scanning worms on peer-to-peer networks
Millions of Internet users are using large-scale peerto-peer (P2P) networks to share content files today. Many other mission-critical applications, such as Internet telephony and...
Guanling Chen, Robert S. Gray
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani