Sciweavers

10435 search results - page 1716 / 2087
» Measuring system normality
Sort
View
WWW
2004
ACM
16 years 7 months ago
Testbed for information extraction from deep web
Search results generated by searchable databases are served dynamically and far larger than the static documents on the Web. These results pages have been referred to as the Deep ...
Yasuhiro Yamada, Nick Craswell, Tetsuya Nakatoh, S...
POPL
2009
ACM
16 years 7 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
ASPLOS
2009
ACM
16 years 7 months ago
Complete information flow tracking from the gates up
For many mission-critical tasks, tight guarantees on the flow of information are desirable, for example, when handling important cryptographic keys or sensitive financial data. We...
Mohit Tiwari, Hassan M. G. Wassel, Bita Mazloom, S...
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 7 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
ESORICS
2009
Springer
16 years 7 months ago
Model-Checking DoS Amplification for VoIP Session Initiation
Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather ...
Carl A. Gunter, José Meseguer, Musab AlTurk...
« Prev « First page 1716 / 2087 Last » Next »