Results 11 to 20 of about 1,793,343 (326)
A solution to the learning dilemma for recurrent networks of spiking neurons
Bellec et al. present a mathematically founded approximation for gradient descent training of recurrent neural networks without backwards propagation in time.
Guillaume Bellec +6 more
doaj +1 more source
Cycles intersecting edge-cuts of prescribed sizes [PDF]
We prove that every cubic bridgeless graph $G$ contains a $2$-factor which intersects all (minimal) edge-cuts of size $3$ or $4$. This generalizes an earlier result of the authors, namely that such a $2$-factor exists provided that $G$ is planar.
Tomáš Kaiser, Riste Škrekovski
doaj +1 more source
What does the future hold for theoretical computer science? [PDF]
Prospects for research in theoretical computer science are discussed. The maintenance of a genuine link between theory and practice is seen as key to the future health of both.
Sannella, Donald
core +1 more source
Canonical forms for free κ-semigroups [PDF]
Automata, Logic and ...
José Carlos Costa
doaj +1 more source
The generalized 3-connectivity of Lexicographic product graphs [PDF]
Graph ...
Xueliang Li, Yaping Mao
doaj +1 more source
Spike frequency adaptation supports network computations on temporally dispersed information
For solving tasks such as recognizing a song, answering a question, or inverting a sequence of symbols, cortical microcircuits need to integrate and manipulate information that was dispersed over time during the preceding seconds.
Darjan Salaj +5 more
doaj +1 more source
The Price of Connectivity for Vertex Cover [PDF]
Graph ...
Eglantine Camby +3 more
doaj +1 more source
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges [PDF]
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Bredereck, Robert +5 more
core +3 more sources
The graph isomorphism problem on geometric graphs [PDF]
Special issue PRIMA ...
Ryuhei Uehara
doaj +1 more source
Incremental Construction of Motorcycle Graphs
We show that the so-called motorcycle graph of a planar polygon can be constructed by a randomized incremental algorithm that is simple and experimentally fast.
Franz Aurenhammer +2 more
doaj +1 more source

