1528 search results - page 227 / 306 » On Signatures for Communication Graphs |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
CSJM
2008
13 years 9 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources suc...