Sciweavers

244 search results - page 16 / 49
» A Linear Search Strategy using Bounds
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 7 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
COMPGEOM
2000
ACM
14 years 1 months ago
A trace bound for the hereditary discrepancy
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
Bernard Chazelle, Alexey Lvov
ICML
2009
IEEE
14 years 9 months ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
ENTCS
2000
123views more  ENTCS 2000»
13 years 8 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
ML
2008
ACM
13 years 8 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer