Search the dblp DataBase

Publications of Author

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