Sciweavers

2299 search results - page 389 / 460
» A Class of Hypercube-Like Networks
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 8 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
14 years 7 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 7 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
CSFW
2009
IEEE
14 years 2 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
P2P
2008
IEEE
137views Communications» more  P2P 2008»
14 years 2 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack