Sciweavers

570 search results - page 80 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
PDPTA
2007
13 years 10 months ago
Multiple Networks for Heterogeneous Distributed Applications
Abstract - We have experienced in our distributed applications that the network is the main limiting factor for performances on clusters. Indeed clusters are cheap and it is easier...
Sylvain Jubertie, Emmanuel Melin
CN
2002
82views more  CN 2002»
13 years 8 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
14 years 9 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
MASS
2010
119views Communications» more  MASS 2010»
13 years 6 months ago
Energy-efficient data redistribution in sensor networks
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
Bin Tang, Neeraj Jaggi, Haijie Wu, Rohini Kurkal
SPAA
2006
ACM
14 years 2 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi