Sciweavers

1060 search results - page 175 / 212
» On the Discovery of Random Trees
Sort
View
IMC
2009
ACM
15 years 4 months ago
When private keys are public: results from the 2008 Debian OpenSSL vulnerability
We report on the aftermath of the discovery of a severe vulnerability in the Debian Linux version of OpenSSL. Systems affected by the bug generated predictable random numbers, mo...
Scott Yilek, Eric Rescorla, Hovav Shacham, Brandon...
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 10 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
15 years 10 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
SPAA
2004
ACM
15 years 3 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
83
Voted
HICSS
2003
IEEE
220views Biometrics» more  HICSS 2003»
15 years 3 months ago
Applications of Hidden Markov Models to Detecting Multi-Stage Network Attacks
This paper describes a novel approach using Hidden Markov Models (HMM) to detect complex Internet attacks. These attacks consist of several steps that may occur over an extended pe...
Dirk Ourston, Sara Matzner, William Stump, Bryan H...