1252 search results - page 153 / 251 » Minimizing Learned Clauses |
131
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of ...
179
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
158
click to vote
ICIAP
1999
ACM
15 years 9 months ago
1999
ACM
In this work we propose a new supervised deformable model that generalizes the classical contour-based snake. This model is defined to deform in a feature space generated by a se...
144
click to vote
EURODAC
1994
IEEE
15 years 9 months ago
1994
IEEE
In this paper we introduce a new knowledgebased method for planning and managing the VLSI design process, based on prediction and advice, that minimizes search in a wide design sp...
135
click to vote
COLT
2006
Springer
15 years 9 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...