539 search results - page 5 / 108 » Recurrence relations and fast algorithms |
COLING
2002
13 years 7 months ago
2002
I present a novel approach to the determination of recurrent sound correspondences in bilingual wordlists. The idea is to relate correspondences between sounds in wordlists to tra...
ISNN
2007
Springer
14 years 1 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
ASPLOS
1991
ACM
13 years 11 months ago
1991
ACM
Access/execute architectures have several advantages over more traditional architectures. Because address generation and memory access are decoupled from operand use, memory laten...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: ...