Sciweavers

13 search results - page 3 / 3
» Largest and Smallest Convex Hulls for Imprecise Points
Sort
View
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 6 months ago
Robust Classification for Imprecise Environments
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...
Foster J. Provost, Tom Fawcett
NIPS
2001
13 years 7 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 1 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux