—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
—A number of analytical models exists that capture various properties of the BitTorrent protocol. However, until now virtually all of these models have been based on the assumpti...
Michel Meulpolder, Johan A. Pouwelse, Dick H. J. E...
This paper addresses support for nzulti-party multimedia applications delivered across datagram wide-area networks such as the Internet. Our approach is to develop a novel retrans...
Matthew T. Lucas, Bert J. Dempsey, Alfred C. Weave...
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
We describe an approach to distributed knowledge acquisition using an ontology. The ontology is used to represent and reason about soldier performance. These methods are embedded ...