Sciweavers

4 search results - page 1 / 1
» Relational Confidence Bounds Are Easy With The Bootstrap
Sort
View
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
14 years 5 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
NIPS
2001
13 years 6 months ago
PAC Generalization Bounds for Co-training
The rule-based bootstrapping introduced by Yarowsky, and its cotraining variant by Blum and Mitchell, have met with considerable empirical success. Earlier work on the theory of c...
Sanjoy Dasgupta, Michael L. Littman, David A. McAl...
IIE
2006
101views more  IIE 2006»
13 years 5 months ago
Random Factors in IOI 2005 Test Case Scoring
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the abilit...
Gordon V. Cormack
ISPAN
2005
IEEE
13 years 11 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...