Search results
- 1.0404691 - UIVT-O 20030011 RIV NL eng J - Journal Article
Šíma, Jiří - Orponen, P.
Exponential Transients in Continuous-Time Liapunov Systems.
Theoretical Computer Science. Roč. 306, - (2003), s. 353-372. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA AV ČR IAB2030007; GA ČR GA201/00/1489; GA ČR GA201/01/1192
Institutional research plan: AV0Z1030915
Keywords : dynamical systems * continuous time * Hopfield network * Liapunov function * convergence time
Subject RIV: BA - General Mathematics
Impact factor: 0.764, year: 2003
Permanent Link: http://hdl.handle.net/11104/0124930File Download Size Commentary Version Access 0404691.pdf 0 963 KB Author´s preprint open-access - 2.0404612 - UIVT-O 20030009 RIV US eng J - Journal Article
Šíma, Jiří - Orponen, P.
Continuous-Time Symmetric Hopfield Nets are Computationally Universal.
Neural Computation. Roč. 15, č. 3 (2003), s. 693-733. ISSN 0899-7667. E-ISSN 1530-888X
R&D Projects: GA AV ČR IAB2030007; GA ČR GA201/02/1456
Institutional research plan: AV0Z1030915
Keywords : continuous-time Hopfield network * Liapunov function * analog computation * computational power * Turing universality
Subject RIV: BA - General Mathematics
Impact factor: 2.747, year: 2003
Permanent Link: http://hdl.handle.net/11104/0124854File Download Size Commentary Version Access 0404612.pdf 10 743.2 KB Author´s preprint open-access - 3.0404255 - UIVT-O 20030112 RIV US eng J - Journal Article
Šíma, Jiří - Orponen, P.
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results.
Neural Computation. Roč. 15, č. 12 (2003), s. 2727-2778. ISSN 0899-7667. E-ISSN 1530-888X
R&D Projects: GA AV ČR IAB2030007; GA ČR GA201/02/1456
Institutional research plan: AV0Z1030915
Keywords : computational power * computational complexity * perceptrons * radial basis functions * spiking neurons * feedforward networks * reccurent networks * probabilistic computation * analog computation
Subject RIV: BA - General Mathematics
Impact factor: 2.747, year: 2003
Permanent Link: http://hdl.handle.net/11104/0124518File Download Size Commentary Version Access 0404255_tutorial.pdf 0 870.7 KB Other open-access 0404255.pdf 0 1 MB Author´s preprint open-access - 4.0403721 - UIVT-O 20000024 RIV US eng J - Journal Article
Šíma, Jiří - Orponen, P. - Antti-Poika, T.
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets.
Neural Computation. Roč. 12, č. 12 (2000), s. 2965-2989. ISSN 0899-7667. E-ISSN 1530-888X
R&D Projects: GA AV ČR IAB2030007
Institutional research plan: AV0Z1030915
Keywords : Hopfield networks * computational power * convergence time * minimum energy problem * analog networks
Subject RIV: BA - General Mathematics
Impact factor: 2.702, year: 2000
Permanent Link: http://hdl.handle.net/11104/0124015File Download Size Commentary Version Access 0403721.pdf 2 602.1 KB Author´s preprint open-access - 5.0108848 - UIVT-O 20040258 RIV NL eng J - Journal Article
Šorel, Michal - Šíma, Jiří
Robust RBF Finite Automata.
[Robustní RBF konečné automaty.]
Neurocomputing. Roč. 62, - (2004), s. 93-110. ISSN 0925-2312. E-ISSN 1872-8286
R&D Projects: GA AV ČR IAB2030007; GA MŠMT LN00A056
Keywords : radial basis function * neural network * finite automaton * Boolean circuit * computational power
Subject RIV: BA - General Mathematics
Impact factor: 0.641, year: 2004
Permanent Link: http://hdl.handle.net/11104/0015963File Download Size Commentary Version Access 0108848.pdf 1 922.2 KB Author´s preprint open-access