35 search results - page 4 / 7 » Size-Time Complexity of Boolean Networks for Prefix Computat... |
ANCS
2006
ACM
13 years 11 months ago
2006
ACM
As Intrusion Detection Systems (IDS) utilize more complex syntax to efficiently describe complex attacks, their processing requirements increase rapidly. Hardware and, even more, ...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
While in computer networks the number of possible protocol encapsulations is growing day after day, network administrators face ever increasing difficulties in selecting accurately...
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...