76 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of LatviaLV26 papers
- University of RostockDE2 papers
- Boğaziçi UniversityTR1 paper
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)DE1 paper
- Forschungszentrum JülichDE1 paper
- IBM Japan, Ltd. (Japan)JP1 paper
- IBM Research - TokyoJP1 paper
- Kyoto UniversityJP1 paper
- Mälardalen UniversitySE1 paper
- Nagoya UniversityJP1 paper
- NTT (Japan)JP1 paper
- Prokhorov General Physics InstituteRU1 paper
26 papers
Goal-Aware Neural SAT Solver
Emils Ozolins, Karlis Freivalds, Andis Draguns +3
Modern neural networks obtain information about the problem and calculate the output solely from the input values. We argue that it is not always optimal, and the network's perform…
Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences
Andis Draguns, Emīls Ozoliņš, Agris Šostaks +2
Attention is a commonly used mechanism in sequence processing, but it is of O(n^2) complexity which prevents its application to long sequences. The recently introduced neural Shuff…
Graph Compact Orthogonal Layout Algorithm
Karlis Freivalds, Jans Glagolevs
There exist many orthogonal graph drawing algorithms that minimize edge crossings or edge bends, however they produce unsatisfactory drawings in many practical cases. In this paper…
A Statistical Method for Object Counting
Jans Glagolevs, Karlis Freivalds
In this paper we present a new object counting method that is intended for counting similarly sized and mostly round objects. Unlike many other algorithms of the same purpose, the…
Lattice of closure endomorphisms of a Hilbert algebra
Jānis Cīrulis
A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomor…
Self-service Ad-hoc Querying Using Controlled Natural Language
Janis Barzdins, Mikus Grasmanis, Edgars Rencis +2
The ad-hoc querying process is slow and error prone due to inability of business experts of accessing data directly without involving IT experts. The problem lies in complexity of…
Polysemy in Controlled Natural Language Texts
Normunds Gruzitis, Guntis Barzdins
Computational semantics and logic-based controlled natural languages (CNL) do not address systematically the word sense disambiguation problem of content words, i.e., they tend to…
A Multilingual FrameNet-based Grammar and Lexicon for Controlled Natural Language
Normunds Gruzitis, Dana Dannélls
Berkeley FrameNet is a lexico-semantic resource for English based on the theory of frame semantics. It has been exploited in a range of natural language processing applications and…
FrameNet Resource Grammar Library for GF
Normunds Gruzitis, Peteris Paikens, Guntis Barzdins
In this paper we present an ongoing research investigating the possibility and potential of integrating frame semantics, particularly FrameNet, in the Grammatical Framework (GF) ap…
Lattice operations on Rickart *-rings
Janis Cirulis
Various authors have investigated properties of the star order (introduced by M.P. Drazin in 1978) on algebras of matrices and of bounded linear operators on a Hilbert space. Ricka…
Correlation functions, universal ratios and Goldstone mode singularities in n-vector models
J. Kaupuzs, R. V. N. Melnik, J. Rimsans
Correlation functions in the O(n) models below the critical temperature are considered. Based on Monte Carlo (MC) data, we confirm the fact stated earlier by Engels and Vogt, that…
Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case
Elina Kalnina, Audris Kalnins, Agris Sostaks +2
This paper describes the solution of Hello World transformations in MOLA transformation language. Transformations implementing the task are relatively straightforward and easily in…
Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations
Agris Sostaks, Elina Kalnina, Audris Kalnins +2
The Reengineering Case of the Transformation Tool Contest 2011 deals with automatic extraction of state machine from Java source code. The transformation task involves complex, non…
Quantum computation with devices whose contents are never read
Abuzer Yakaryilmaz, Rusins Freivalds, A. C. Cem Say +1
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no ad…
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
Andris Ambainis, Kazuo Iwama, Masaki Nakanishi +4
This paper considers the query complexity of the functions in the family F_{N,M} of N-variable Boolean functions with onset size M, i.e., the number of inputs for which the functio…
Some aspects of the nonperturbative renormalization of the phi^4 model
J. Kaupuzs
A nonperturbative renormalization of the phi^4 model is considered. First we integrate out only a single pair of conjugated modes with wave vectors +/- q. Then we are looking for t…
Zero range model of traffic flow
J. Kaupuzs, R. Mahnke, R. J. Harris
A multi--cluster model of traffic flow is studied, in which the motion of cars is described by a stochastic master equation. Assuming that the escape rate from a cluster depends on…
Surface tension and interfacial fluctuations in d-dimensional Ising model
J. Kaupuzs
The surface tension of rough interfaces between coexisting phases in 2D and 3D Ising models are discussed in view of the known results and some original calculations presented in t…
Interpretation of experimental data near lambda-transition point in liquid helium
J. Kaupuzs
The recently published experimental data for specific heat C_p of liquid helium in zero gravity conditions very close to the lambda-transition have been discussed. We have shown th…
Polarization kinetics in ferroelectrics with regard to fluctuations
J. Kaupuzs, J. Rimshans, N. F. Smyth
Polarization in ferroelectrics, described by the Landau-Ginzburg Hamiltonian, is considered, based on a multi-dimensional Fokker-Planck equation. This formulation describes the tim…
Probabilistic Reversible Automata and Quantum Automata
Marats Golovkins, Maksim Kravtsev
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic autom…
Probabilistic Description of Traffic Breakdowns
Reinhart Kuhne, Reinhard Mahnke, Ihor Lubashevsky +1
We analyze the characteristic features of traffic breakdown. To describe this phenomenon we apply to the probabilistic model regarding the jam emergence as the formation of a large…
Critical exponents predicted by grouping of Feynman diagrams in phi^4 model
J. Kaupuzs
Different perturbation theory treatments of the Ginzburg-Landau phase transition model are discussed. This includes a criticism of the perturbative renormalization group (RG) appro…
Quantum Pushdown Automata
Marats Golovkins
Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore and J. P. Crutchfield. In this paper we introduce the notion of QPA in a non-e…