Sciweavers

3247 search results - page 389 / 650
» Randomized smoothing networks
Sort
View
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
16 years 8 months ago
Bypass Caching: Making Scientific Databases Good Network Citizens
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...
Tanu Malik, Randal C. Burns, Amitabh Chaudhary
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
16 years 7 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
PERCOM
2006
ACM
16 years 6 months ago
A Collusion Attack on Pairwise Key Predistribution Schemes for Distributed Sensor Networks
Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback ...
Tyler Moore
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
16 years 4 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari