2007 |
24 | EE | Jirí Síma,
Stanislav Zák:
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3.
SOFSEM (1) 2007: 522-531 |
2006 |
23 | EE | Jirí Síma,
Satu Elisa Schaeffer:
On the NP-Completeness of Some Graph Cluster Measures.
SOFSEM 2006: 530-537 |
2005 |
22 | EE | Jirí Síma:
Optimal Triangle Stripifications as Minimum Energy States in Hopfield Nets.
ICANN (1) 2005: 199-204 |
21 | EE | Jirí Síma,
Satu Elisa Schaeffer:
On the NP-Completeness of Some Graph Cluster Measures
CoRR abs/cs/0506100: (2005) |
20 | EE | Jirí Síma,
Jiri Sgall:
On the Nonlearnability of a Single Spiking Neuron.
Neural Computation 17(12): 2635-2647 (2005) |
2004 |
19 | EE | Michal Sorel,
Jirí Síma:
Robust RBF finite automata.
Neurocomputing 62: 93-110 (2004) |
2003 |
18 | EE | Jirí Síma:
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays.
ALT 2003: 221-233 |
17 | EE | Jirí Síma,
Pekka Orponen:
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results.
Neural Computation 15(12): 2727-2778 (2003) |
16 | EE | Jirí Síma,
Pekka Orponen:
Continuous-Time Symmetric Hopfield Nets Are Computationally Universal.
Neural Computation 15(3): 693-733 (2003) |
15 | EE | Jirí Síma,
Pekka Orponen:
Exponential transients in continuous-time Liapunov systems.
Theor. Comput. Sci. 306(1-3): 353-372 (2003) |
2002 |
14 | EE | Jirí Síma:
Training a Single Sigmoidal Neuron Is Hard.
Neural Computation 14(11): 2709-2728 (2002) |
2001 |
13 | EE | Jirí Síma:
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard.
ALT 2001: 92-105 |
12 | EE | Jirí Síma,
Pekka Orponen:
Exponential Transients in Continuous-Time Symmetric Hopfield Nets.
ICANN 2001: 806-813 |
11 | EE | Jirí Síma,
Pekka Orponen:
Computing with continuous-time Liapunov systems.
STOC 2001: 722-731 |
10 | | Jirí Síma,
Pekka Orponen,
Teemu Antti-Poika:
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets.
Neural Computation 12(12): 2965-2989 (2001) |
2000 |
9 | EE | Michal Sorel,
Jirí Síma:
Robust Implementaion of Finite Automata by Recurrent RBF Networks.
SOFSEM 2000: 431-439 |
1999 |
8 | EE | Jirí Síma,
Pekka Orponen,
Teemu Antti-Poika:
Some Afterthoughts on Hopfield Networks.
SOFSEM 1999: 459-469 |
7 | | Jirí Síma:
Table Rounding Problem.
Computers and Artificial Intelligence 18(2): (1999) |
1998 |
6 | EE | Jirí Síma,
Jirí Wiedermann:
Theory of Neuromata.
J. ACM 45(1): 155-178 (1998) |
1996 |
5 | | Jirí Síma:
Aunt's Problem: Table Rounding.
SOFSEM 1996: 441-450 |
4 | EE | Jirí Síma:
Back-propagation is not Efficient.
Neural Networks 9(6): 1017-1023 (1996) |
1995 |
3 | | Jirí Síma,
Jirí Wiedermann:
Neural Language Acceptors.
Developments in Language Theory 1995: 430-439 |
2 | | Jirí Síma:
Hopfield Languages.
SOFSEM 1995: 461-468 |
1 | EE | Jirí Síma:
Neural expert systems.
Neural Networks 8(2): 261-271 (1995) |