1641 search results - page 17 / 329 » Termination Analysis with Algorithmic Learning |
ICML
1997
IEEE
15 years 10 months ago
1997
IEEE
The Rocchio relevance feedback algorithm is one of the most popular and widely applied learning methods from information retrieval. Here, a probabilistic analysis of this algorith...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
ICONIP
2007
14 years 11 months ago
2007
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
83
Voted
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...