Results 1 to 10 of about 691,541 (189)
Balanced Avoidance Games on Random Graphs [PDF]
We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with $n$ vertices are revealed two at a time in a random order.
Martin Marciniszyn +2 more
doaj +1 more source
A Probabilistic Counting Lemma for Complete Graphs [PDF]
We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke +2 more
doaj +1 more source
Special Issue on ‘Computer Science in Sport’
Computer Science in Sport is a cross-disciplinary topic that brings together the problem-solving capabilities of Computer Science to various theoretical and practical aspects of all sports and physical activities [...]
Christian Dawson
doaj +1 more source
Theoretical Computer Science for the Working Category Theorist [PDF]
Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the ...
N. Yanofsky
semanticscholar +1 more source
The Best Practice of Teach Computer Science Students to Use Paper Prototyping
The importance of understanding the repercussions of effective user interface (UI) design is critical for future Computer Science (CS) professionals, given the ubiquity of interfaces on computer devices. Through a paper prototyping activity, this article
Dave Miller
semanticscholar +1 more source
Concerns about participation in computer science at all levels of education continue to rise, despite the substantial efforts of research, policy, and world-wide education initiatives.
Maria Kallia, Q. Cutts
semanticscholar +1 more source
The purpose of this study was to identify international trends in K–12 computer science curricula in countries that have introduced computer science education.
M. Oda, Yoko Noborimoto, T. Horita
semanticscholar +1 more source
Theoretical Computer Science [PDF]
Book Front Matter of LNCS ...
Baeten, Jos, Ball, Tom, de Boer, Frank
openaire +1 more source
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

