Results 11 to 20 of about 1,114,155 (295)
Comparison of tracking algorithms implemented in OpenCV [PDF]
MATEC Web of Conferences, 2016 Computer vision is very progressive and modern part of computer science. From scientific point of view, theoretical aspects of computer vision algorithms prevail in many papers and publications. The underlying theory is really important, but on the other
Janku Peter +3 more
doaj +3 more sources
Specifying and Verifying Properties of Space - Extended Version [PDF]
, 2014 The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems distributed in ...
Ciancia, Vincenzo +3 more
core +2 more sources
The skewness of computer science [PDF]
, 2010 Computer science is a relatively young discipline combining science, engineering, and mathematics. The main flavors of computer science research involve the theoretical development of conceptual models for the different aspects of computing and the more ...
Franceschet, Massimo
core +1 more source
The normalized Laplacian spectrum of subdivisions of a graph [PDF]
, 2016 Determining and analyzing the spectra of graphs is an important and exciting research topic in mathematics science and theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties ...
Comellas Padró, Francesc de Paula +2 more
core +1 more source
Texts and computations, mechanisms and abstractions. Dualism and digital editions
JLIS.it, 2019 Critical thinking on digital editions, and in particular scholarly editions, has been so far mainly focused on redefining the theoretical aspects developed in an analogical dimension, such as textual orientations, following a technological approach.
Federico Meschini
doaj +6 more sources
Profinite Techniques for Probabilistic Automata and the Markov Monoid Algorithm [PDF]
, 2017 We consider the value 1 problem for probabilistic automata over finite words: it asks whether a given probabilistic automaton accepts words with probability arbitrarily close to 1. This problem is known to be undecidable.
Fijalkow, Nathanaël
core +4 more sources
On Iterated Dominance, Matrix Elimination, and Matched Paths [PDF]
, 2010 We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak ...
Brandt, Felix +2 more
core +5 more sources
Computing Least Fixed Points of Probabilistic Systems of Polynomials [PDF]
, 2010 We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1.
Esparza, Javier +2 more
core +7 more sources
COMPUTATIONAL LINGUISTICS AND ARTIFICIAL INTELLIGENCE [PDF]
Ziglôbitha: Computational linguistics, as an interdisciplinary field combining linguistics and computer science, aims to enable computers to process natural language.
Affas MAAMAR & Hadjer HADJCHERIF
doaj +1 more source
Preface of the Special Issue on Theoretical Aspects of Computer Science (2018) [PDF]
Theory of Computing Systems, 2020 This special issue contains eight articles which are based on extended abstracts that were presented at the 35th Symposium on Theoretical Aspects of Computer Science (STACS), which was held at the University of Caen from February 28th to March 3rd, 2018.
Niedermeier, Rolf, Vallée, Brigitte
openaire +2 more sources