Sciweavers

117 search results - page 21 / 24
» Anti-Sniffing in Unbounded Networks
Sort
View
PVLDB
2008
108views more  PVLDB 2008»
14 years 9 months ago
Sliding-window top-k queries on uncertain streams
Query processing on uncertain data streams has attracted a lot of attentions lately, due to the imprecise nature in the data generated from a variety of streaming applications, su...
Cheqing Jin, Ke Yi, Lei Chen 0002, Jeffrey Xu Yu, ...
ICDCS
2012
IEEE
13 years 2 days ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
DC
2010
14 years 9 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
Jeffrey G. Andrews, Nihar Jindal, Martin Haenggi, ...
PODC
2010
ACM
14 years 11 months ago
Brief announcement: adaptive content placement for peer-to-peer video-on-demand systems
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
Bo Tan, Laurent Massoulié