13214 search results - page 2558 / 2643 » Pseudorandomness for network algorithms |
165
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle ...
171
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
166
click to vote
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
136
click to vote
INFOSCALE
2007
ACM
15 years 5 months ago
2007
ACM
We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with bandwidth consumption that has been ide...
142
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...