Sciweavers

3370 search results - page 624 / 674
» Correlation Embedding Analysis
Sort
View
DSN
2009
IEEE
14 years 2 months ago
On the effectiveness of low latency anonymous network in the presence of timing attack
In this paper, we introduce a novel metric that can quantitatively measure the practical effectiveness (i.e. anonymity) of all anonymous networks in the presence of timing attack....
Jing Jin, Xinyuan Wang
ICDM
2009
IEEE
148views Data Mining» more  ICDM 2009»
14 years 2 months ago
Online System Problem Detection by Mining Patterns of Console Logs
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 2 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
COLCOM
2008
IEEE
14 years 2 months ago
Data Quality and Failures Characterization of Sensing Data in Environmental Applications
Environmental monitoring is one of the most important sensor network application domains. The success of those applications is determined by the quality of the collected data. Thu...
Kewei Sha, Guoxing Zhan, Safwan Al-Omari, Tim Cala...
FOCS
2008
IEEE
14 years 2 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson