Sciweavers

19 search results - page 4 / 4
» Using biased coins as oracles
Sort
View
ENTCS
2002
139views more  ENTCS 2002»
13 years 5 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
KDD
2009
ACM
205views Data Mining» more  KDD 2009»
14 years 1 days ago
From active towards InterActive learning: using consideration information to improve labeling correctness
Data mining techniques have become central to many applications. Most of those applications rely on so called supervised learning algorithms, which learn from given examples in th...
Abraham Bernstein, Jiwen Li
ISI
2002
Springer
13 years 5 months ago
Getting right answers from incomplete multidimensional databases
Dealing with large volumes of data, OLAP data cubes aggregated values are often spoiled by errors due to missing values in detailed data. This paper suggests to adjust aggregate an...
Sabine Goutier, Georges Hébrail, Vér...
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
13 years 12 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf