Publicēti raksti (MII) / Published Articles
Искать по
LU Matemātikas un informātikas institūta personāla publicēti raksti.
Недавние добавления
-
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 ... -
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, ... -
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) -
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) -
Comparing various concepts of function prediction. Part 1.
(Latvia State University, 1974)Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ... -
Comparing various concepts of function prediction. Part 2.
(Latvia State University, 1975)Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ... -
ORNAMENTAL SIGN LANGUAGE IN THE FIRST ORDER TRACERY BELTS
(QuantumDream, Inc., 2013-09-02) -
Comparing various types of limiting synthesis and prediction of functions
(Latvia State University, 1974) -
Inductive inference of recursive functions: complexity bounds
(Springer Verlag, 1991)This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. ... -
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 ...
RSS 1.0