13214 search results - page 300 / 2643 » Pseudorandomness for network algorithms |
151
click to vote
IPTPS
2004
Springer
16 years 2 days ago
2004
Springer
— The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existin...
211
click to vote
SIGMETRICS
2012
ACM
13 years 9 months ago
2012
ACM
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
189
click to vote
IJCV
2012
13 years 9 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
149
click to vote
CONEXT
2007
ACM
15 years 10 months ago
2007
ACM
Disparate algorithms are being designed to decide certain basic questions in opportunistic networks. This position paper describes a nascent idea that aims to provide a single fra...