Sciweavers

524 search results - page 102 / 105
» On the Maximum Number of Cliques in a Graph
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
FOCS
2004
IEEE
13 years 11 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
TON
2010
152views more  TON 2010»
13 years 5 months ago
1 + N network protection for mesh networks: network coding-based protection using p-cycles
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
Ahmed E. Kamal
GC
2007
Springer
13 years 7 months ago
Local Topological Toughness and Local Factors
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
Frank Göring, Gyula Y. Katona
SPAA
2010
ACM
14 years 9 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...