Browsing Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science by Title
Now showing items 41-60 of 79
-
On speeding up synthesis and prediction of functions
(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, ... -
One more geodesic graph
(2013-12-17)In this note, written in Latvian, a way to build geodesic graphs, graphs with unique shortest path between every two vertices, is considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of ... -
Ornamental sign language in the first order tracery belts
(Prespacetime Journal, 2010)We consider an ornamental sign language of first order where principles of sieve displacement, of asymmetric building blocks as a base of ornament symmetry, color exchangeability and side equivalence principles work. Generic ... -
ORNAMENTAL SIGN LANGUAGE IN THE FIRST ORDER TRACERY BELTS
(QuantumDream, Inc., 2013-09-02) -
Par n dimensiju Eiklīda telpas līknēm
(1936-10) -
Par oskulāciju, superoskulāciju un charakteristiskiem punktiem
(1943-04)No Dr. A.Lūša raksturojuma E.Grinberga zinātniskajam darbam: Doktora disertacija, ko E.Grīnbergs sācis strādāt 1940/41 m.g. Latvija Valsts Universitātē un aizstāvējis Rīgas Universitātē 1944.g. /oponenti prof.Dr.A.Lūsis, ... -
Platonism, intuition and the nature of mathematics
(Bulgarian Academy of Sciences, Sofia, 1988)Platonism is an essential aspect of mathematical method. Mathematicians are learned ability " t o l i v e " in the "world" of mathematical concepts. Here we have the main source of the creative power of mathematics, and ... -
Prediction of the next value of a function
(1981)The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f ... -
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 ... -
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 ... -
RIGOTRIO at SemEval-2017 Task 9: Combining Machine Learning and Grammar Engineering for AMR Parsing and Generation
(Association for Computational Linguistics, 2017-08)By addressing both text-to-AMR parsing and AMR-to-text generation, SemEval-2017 Task 9 established AMR as a powerful semantic interlingua. We strengthen the interlingual aspect of AMR by applying the multilingual Grammatical ... -
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 ...