400 search results - page 10 / 80 » Approximation Stability and Boosting |
ACCV
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
SIAMCO
2008
13 years 7 months ago
2008
We introduce two new tools that can be useful in nonlinear observer and output feedback design. The first one is a simple extension of the notion of homogeneous approximation to ma...
MP
2010
13 years 6 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
ML
2012
ACM
12 years 3 months ago
2012
ACM
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...