Sciweavers

374 search results - page 37 / 75
» Evaluating path queries over route collections
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
GIS
2007
ACM
14 years 11 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
COMCOM
2004
138views more  COMCOM 2004»
13 years 9 months ago
Issues with inferring Internet topological attributes
A number of recent studies of Internet network structure are based on data collected from inter-domain BGP routing tables and tools, such as traceroute, to probe end-to-end paths....
Lisa Amini, Anees Shaikh, Henning Schulzrinne
DBISP2P
2003
Springer
100views Database» more  DBISP2P 2003»
14 years 3 months ago
Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters
Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that ...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
ICDCS
2002
IEEE
14 years 2 months ago
An Optimal Strategy for Anonymous Communication Protocols
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao