Sciweavers

5793 search results - page 1135 / 1159
» Individual communication complexity
Sort
View
SP
1989
IEEE
13 years 11 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik
ANCS
2007
ACM
13 years 11 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
CHIMIT
2007
ACM
13 years 11 months ago
Network-centricity: hindered by hierarchical anchors
Network-centricity is a concept under consideration as a useful paradigm for complex organizational operations, combining the strengths of bureaucracy with the innovative possibil...
Steve Abrams, Gloria Mark
DMSN
2007
ACM
13 years 11 months ago
SenseSwarm: a perimeter-based data acquisition framework for mobile sensor networks
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
13 years 11 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
« Prev « First page 1135 / 1159 Last » Next »