Sciweavers

71228 search results - page 63 / 14246
» Algorithms
Sort
View
NIPS
1994
15 years 2 months ago
Convergence Properties of the K-Means Algorithms
This paper studies the convergence properties of the well known K-Means clustering algorithm. The K-Means algorithm can be described either as a gradient descent algorithmor by sl...
Léon Bottou, Yoshua Bengio
CORR
2008
Springer
57views Education» more  CORR 2008»
15 years 1 months ago
Fast Conversion Algorithms for Orthogonal Polynomials
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
Alin Bostan, Bruno Salvy, Éric Schost
TSMC
2002
69views more  TSMC 2002»
15 years 1 months ago
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environm
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
Norio Baba, Yoshio Mogami
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
15 years 8 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
SIGCSE
2005
ACM
180views Education» more  SIGCSE 2005»
15 years 7 months ago
Analyze that: puzzles and analysis of algorithms
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...
Anany Levitin