Results 11 to 20 of about 32,657,892 (281)
Learning objectives for courses in the Department of Computer Science, Oregon State University [PDF]
This document describes the overall learning objectives for courses in the department of computer science at Oregon State ...
Oregon State University. Department of Computer Science
core +6 more sources
The generalized 3-connectivity of Lexicographic product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xueliang Li, Yaping Mao
doaj +1 more source
The Price of Connectivity for Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Eglantine Camby +3 more
doaj +1 more source
Spike frequency adaptation supports network computations on temporally dispersed information
eLife, 2021 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
Cycles intersecting edge-cuts of prescribed sizes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Canonical forms for free κ-semigroups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Automata, Logic and ...
José Carlos Costa
doaj +1 more source
The graph isomorphism problem on geometric graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Special issue PRIMA ...
Ryuhei Uehara
doaj +1 more source
Incremental Construction of Motorcycle Graphs
Algorithms, 2022 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
Normal Functions as a New Way of Defining Computable Functions [PDF]
Computer Science, 2004 Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way.
Leszek Dubiel
doaj
Generating Turing Machines by Use of Other Computation Models [PDF]
Computer Science, 2003 For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. Because this is very simple model programs tend to be very complicated and hard to analyse by human.
Leszek Dubiel
doaj