Sciweavers

3422 search results - page 215 / 685
» Random Subset Optimization
Sort
View
ICML
2006
IEEE
16 years 7 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
DATE
2009
IEEE
119views Hardware» more  DATE 2009»
16 years 1 months ago
Statistical fault injection: Quantified error and confidence
— Fault injection has become a very classical method to determine the dependability of an integrated system with respect to soft errors. Due to the huge number of possible error ...
Régis Leveugle, A. Calvez, Paolo Maistri, P...
COLT
2007
Springer
16 years 17 days ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 10 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
CCCG
2008
15 years 7 months ago
Data Structures for Range-Aggregate Extent Queries
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...