Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science: Recent submissions
Now showing items 21-40 of 79
-
On computation in the limit by non-deterministic Turing machines
(Scientific Proceedings of Latvia State University, 1974) -
On the reducibility of function classes
(Latvia State University, 1972)N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, ... -
Fragile Correctness of Social Network Analysis
(2016-11-07)Graph techniques are widely used in social network analysis. However, there are some disputable applications where results are obtained from the graphs using paths longer than one and are not simply applicable to objects ... -
A systematic review of SQL-on-Hadoop by using compact data formats
(2016-10-30)There are huge volumes of raw data generated every day. The question is how to store these data in order to provide faster data access. The research direction in Big Data projects using Hadoop Technology, MapReduce kind ... -
Attēlu līniju atpazīšana eksperimentālā sistēmā ar paralēlas apstrādes elementiem
(2015-12-10)Aprakstīts algoritmisks eksperiments, kas veikts ar nolūku pārliecināties, ka ļoti vienkārša, pat primitīva, bet būtiski paralelizēta, redzes datu primārā apstrāde ir pietiekoši spēcīga, lai tiktu detektētas svarīgas attēla ... -
Modeling and Query Language for Hospitals
(Springer, 2013) -
Computational complexity of prediction strategies
(Latvia State University, 1977)The value f(m+1) is predicted from given f(1), ..., f(m). For every enumeration T(n, x) there is a strategy that predicts the n-th function of T making no more than log2(n) errors (Barzdins-Freivalds). It is proved in the ... -
Probabilistic program synthesis
(Latvia State University, 1977)The following model of inductive inference is considered. Arbitrary numbering tau = {tau_0, tau_1, tau_2, ... } of total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function ... -
The Transformation - Driven Architecture for Interactive Systems
(Springer, 2013) -
Nonlinear Spectra: the Neumann Problem
(Vilnius Gediminas Technical University, 2009) -
FrameNet CNL: a Knowledge Representation and Information Extraction Language
(Springer, 2014) -
UML Style Graphical Notation
(Springer, 2010) -
Testing 4-critical plane and projective plane multiwheels using Mathematica
(2015-10-27)In this article we explore 4-critical graphs using Mathematica. We generate graph patterns according [1, D. Zeps. On building 4-critical plane and projective plane multiwheels from odd wheels, arXiv:1202.4862v1]. Using ... -
Root cause analysis of large scale application testing results
(2015-08-24)In this paper we present a new root cause analysis algorithm for discovering the most likely causes of the differences found in testing results of two versions of the same software. The problematic points in test and ... -
Redzes efekti, Ar redzi saistītas parādības, ilūzijas, iespaidi
(2014-04-29)Apkopoti dažādi ar redzi saistīti jautājumi, kuri ar studentiem pārrunāti Latvijas Universitātes Fizikas un matemātikas fakultātes Datorikas nodaļas specseminārā „Attēlu sintēze un analīze”. Jautājumi nosacīti grupējami ... -
On computation in the limit by non-deterministic Turing machines
(Latvia State University, 1974) -
On speeding up synthesis and prediction of functions
(Latvia State University, 1974)