Sciweavers

6110 search results - page 429 / 1222
» Approximate Computing
Sort
View
ECCC
2006
109views more  ECCC 2006»
15 years 6 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
NECO
2008
112views more  NECO 2008»
15 years 6 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
AMC
2011
14 years 10 months ago
Ruin theory with excess of loss reinsurance and reinstatements
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
Hansjörg Albrecher, Sandra Haas
TCSV
2008
131views more  TCSV 2008»
15 years 6 months ago
Fast Optimal Motion Estimation Based on Gradient-Based Adaptive Multilevel Successive Elimination
In this paper, we propose a fast and optimal solution for block motion estimation based on an adaptive multilevel successive elimination algorithm. This algorithm is accomplished b...
Shao-Wei Liu, Shou-Der Wei, Shang-Hong Lai
ICML
1996
IEEE
15 years 11 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos