Sciweavers

970 search results - page 181 / 194
» On encodings of spanning trees
Sort
View
PAM
2007
Springer
14 years 4 months ago
Two Days in the Life of the DNS Anycast Root Servers
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nev...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 4 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
INFOCOM
2006
IEEE
14 years 3 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
P2P
2006
IEEE
121views Communications» more  P2P 2006»
14 years 3 months ago
The Orchard Algorithm: P2P Multicasting without Free-Riding
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
Jan-David Mol, Dick H. J. Epema, Henk J. Sips
JCDL
2004
ACM
128views Education» more  JCDL 2004»
14 years 3 months ago
Panorama: extending digital libraries with topical crawlers
A large amount of research, technical and professional documents are available today in digital formats. Digital libraries are created to facilitate search and retrieval of inform...
Gautam Pant, Kostas Tsioutsiouliklis, Judy Johnson...