Sciweavers

239 search results - page 21 / 48
» Localized Upper and Lower Bounds for Some Estimation Problem...
Sort
View
COLT
1997
Springer
15 years 1 months ago
Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation
: In this paper we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization error: that is, bounds showing that the worst-case e...
Michael J. Kearns, Dana Ron
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 11 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
83
Voted
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 9 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
MFCS
2010
Springer
14 years 8 months ago
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud