412 search results - page 6 / 83 » A New Proof of the F5 Algorithm |
TSP
2008
14 years 11 months ago
2008
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
88
Voted
COLT
2005
Springer
15 years 5 months ago
2005
Springer
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
101
Voted
SIGSOFT
2006
ACM
16 years 10 days ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
COLT
2008
Springer
15 years 1 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
ICCAD
2004
IEEE
15 years 8 months ago
2004
IEEE
— This paper presents two contributions. The first is an incremental placement algorithm for placement-aware logic synthesis along with a proof of optimality. The algorithm can ...