Sciweavers

2924 search results - page 347 / 585
» Lower Bounds in Distributed Computing
Sort
View
NDSS
2008
IEEE
15 years 11 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
SRDS
2008
IEEE
15 years 11 months ago
Adaptive Internal Clock Synchronization
Existing clock synchronization algorithms assume a bounded clock reading error. This, in turn, results in an inflexible design that typically requires node crashes whenever the g...
Zbigniew Jerzak, Robert Fach, Christof Fetzer
SAC
2004
ACM
15 years 10 months ago
Mining dependence rules by finding largest itemset support quota
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
Alexandr A. Savinov
FOCS
1999
IEEE
15 years 9 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
CCR
2004
90views more  CCR 2004»
15 years 4 months ago
A constraint satisfaction approach to testbed embedding services
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...