Sciweavers

1382 search results - page 110 / 277
» Formal Analysis of Online Algorithms
Sort
View
MEMOCODE
2003
IEEE
15 years 11 months ago
Optimizations for Faster Execution of Esterel Programs
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
Dumitru Potop-Butucaru, Robert de Simone
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 7 months ago
Load Distribution Fairness in P2P Data Management Systems
We address the issue of measuring storage, or query load distribution fairness in peer-to-peer data management systems. Existing metrics may look promising from the point of view ...
Theoni Pitoura, Peter Triantafillou
139
Voted
ICML
2001
IEEE
16 years 7 months ago
Expectation Maximization for Weakly Labeled Data
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
Yuri A. Ivanov, Bruce Blumberg, Alex Pentland
120
Voted
ICDM
2008
IEEE
155views Data Mining» more  ICDM 2008»
16 years 17 days ago
Alert Detection in System Logs
We present Nodeinfo, an unsupervised algorithm for anomaly detection in system logs. We demonstrate Nodeinfo’s effectiveness on data from four of the world’s most powerful sup...
Adam J. Oliner, Alex Aiken, Jon Stearley
IJISEC
2010
114views more  IJISEC 2010»
15 years 3 months ago
A new hardware-assisted PIR with O(n) shuffle cost
Abstract Since the concept of private information retrieval (PIR) was first formalized by Chor et. al, various constructions have been proposed with a common goal of reducing commu...
Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong...