Sciweavers

158 search results - page 30 / 32
» The Cover Time, the Blanket Time, and the Matthews Bound
Sort
View
CCS
2006
ACM
13 years 9 months ago
Dynamic rule-ordering optimization for high-speed firewall filtering
Packet filtering plays a critical role in many of the current high speed network technologies such as firewalls and IPSec devices. The optimization of firewall policies is critica...
Hazem Hamed, Ehab Al-Shaer
DRM
2004
Springer
14 years 25 days ago
Analysis of an incentives-based secrets protection system
Once electronic content has been released it is very difficult to prevent copies of the content from being widely distributed. Such distribution can cause economic harm to the con...
N. Boris Margolin, Matthew Wright, Brian Neil Levi...
CASES
2005
ACM
13 years 9 months ago
MTSS: multi task stack sharing for embedded systems
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
Bhuvan Middha, Matthew Simpson, Rajeev Barua
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
12 years 11 months ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking