Sciweavers

183 search results - page 16 / 37
» Correlation in Hard Distributions in Communication Complexit...
Sort
View
IMC
2009
ACM
14 years 5 months ago
Network level footprints of facebook applications
With over half a billion users, Online Social Networks (OSNs) are the major new applications on the Internet. Little information is available on the network impact of OSNs, althou...
Atif Nazir, Saqib Raza, Dhruv Gupta, Chen-Nee Chua...
CCR
2010
151views more  CCR 2010»
13 years 8 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
IMC
2006
ACM
14 years 4 months ago
Understanding churn in peer-to-peer networks
The dynamics of peer participation, or churn, are an inherent property of Peer-to-Peer (P2P) systems and critical for design and evaluation. Accurately characterizing churn requir...
Daniel Stutzbach, Reza Rejaie
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 2 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
ICS
2003
Tsinghua U.
14 years 3 months ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas