Results 21 to 30 of about 1,693,747 (308)
The Price of Connectivity for Vertex Cover [PDF]
Graph ...
Eglantine Camby+3 more
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
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
What Idea of Information Do ICT Practitioners Have in Mind?
We mean to reflect on the divide extant between theoretical studies on information and the knowledge of information shared by ICT (information and communication technologies) professionals.
Paolo Rocchi
doaj +1 more source
Canonical forms for free κ-semigroups [PDF]
Automata, Logic and ...
José Carlos Costa
doaj +1 more source
Eigenvectors of random matrices: A survey [PDF]
Eigenvectors of large matrices (and graphs) play an essential role in combinatorics and theoretical computer science. The goal of this survey is to provide an up-to-date account on properties of eigenvectors when the matrix (or graph) is random.Comment ...
O'Rourke, Sean, Vu, Van, Wang, Ke
core +2 more sources
A Model of Fast Hebbian Spike Latency Normalization
Hebbian changes of excitatory synapses are driven by and enhance correlations between pre- and postsynaptic neuronal activations, forming a positive feedback loop that can lead to instability in simulated neural networks.
Hafsteinn Einarsson+4 more
doaj +1 more source
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