Sciweavers

5056 search results - page 952 / 1012
» Network Coding Theory
Sort
View
NDSS
2008
IEEE
15 years 8 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
SENSYS
2006
ACM
15 years 8 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
MSWIM
2005
ACM
15 years 8 months ago
Non-saturation and saturation analysis of IEEE 802.11e EDCA with starvation prediction
An analytical model is proposed to describe the priority schemes of the EDCA mechanism of the IEEE 802.11e standard. EDCA provides class-based differentiated QoS to IEEE 802.11 WL...
Paal Engelstad, Olav N. Østerbø
MSWIM
2005
ACM
15 years 8 months ago
An analytical model of the virtual collision handler of 802.11e
A number of analytical models have been proposed to describe the priority schemes of the Enhanced Distributed Channel Access (EDCA) mechanism of the IEEE 802.11e standard. EDCA pr...
Paal E. Engelstad, Olav N. Østerbø
118
Voted
PODC
2005
ACM
15 years 8 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking