Sciweavers

5214 search results - page 329 / 1043
» The Online Specialization Problem
Sort
View
NIPS
2003
15 years 8 months ago
Multiple-Instance Learning via Disjunctive Programming Boosting
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
Stuart Andrews, Thomas Hofmann
UAI
2000
15 years 8 months ago
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
Michael C. Horsch, William S. Havens
DAM
2006
63views more  DAM 2006»
15 years 6 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
179
Voted
IJCV
2006
79views more  IJCV 2006»
15 years 6 months ago
Splines in Higher Order TV Regularization
Splines play an important role as solutions of various interpolation and approximation problems that minimize special functionals in some smoothness spaces. In this paper, we show ...
Gabriele Steidl, Stephan Didas, Julia Neumann
JGO
2008
53views more  JGO 2008»
15 years 6 months ago
Smoothing by mollifiers. Part II: nonlinear optimization
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
Hubertus Th. Jongen, Oliver Stein