Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Sima, Jiri"'
Publikováno v:
In Neural Networks October 2024 178
Autor:
Jancar, Petr, Sima, Jiri
We introduce a new notion of C-simple problems for a class C of decision problems (i.e. languages), w.r.t. a particular reduction. A problem is C-simple if it can be reduced to each problem in C. This can be viewed as a conceptual counterpart to C-ha
Externí odkaz:
http://arxiv.org/abs/2102.10416
Autor:
Šíma, Jiří
We analyze the computational power of discrete-time recurrent neural networks (NNs) with the saturated-linear activation function within the Chomsky hierarchy. This model restricted to integer weights coincides with binary-state NNs with the Heavisid
Externí odkaz:
http://arxiv.org/abs/2102.01633
Autor:
Šíma, Jiří, Žák, Stanislav
Publikováno v:
Fundamenta Informaticae, Volume 184, Issue 4 (March 10, 2022) fi:7043
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental issue of derandomizing space-bounded computations. Such constructions have been known
Externí odkaz:
http://arxiv.org/abs/2101.01151
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Sima, Jiri, Schaeffer, Satu Elisa
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness functions that measure the quality of a cluster within the graph. Examples
Externí odkaz:
http://arxiv.org/abs/cs/0506100
Publikováno v:
In Energy Procedia August 2015 74:177-183