568 search results - page 51 / 114 » New bounds for the Cebysev functional |
COLT
2000
Springer
14 years 1 days ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
TIT
2008
13 years 7 months ago
2008
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...