The aim of this paper is to propose a new solution concept for the roommate problem with strict preferences. We introduce maximum irreversible matchings and consider almost stable matchings (Abraham et al. [3]) and maximum stable matchings (Tan [32], [34]). These solution concepts are all core consistent. We find that almost stable matchings are incompatible with the other two concepts. Hence, ...

Research of the Hungarian Niphargus species is a rather neglected field. This is due to the growing distance between the  level of knowledge about Hungarian species and the elaboration determined by the international publications, which had caused a hardly negotiable inconvenience in the judgment of the state of the Hungarian species. The clarification of species in questionable positions could...

Conjecture 0.3 has a fairly interesting reformulation with some ”Ramsey flavor”. A set of pairwise disjoint edges e1, e2, . . . , et of G is called a connected matching of size t ([8]) if for every 1 ≤ i < j ≤ t there exists at least one edge of G connecting an endpoint of ei to an endpoint of ej . Alfréd Rényi Institute, Hungarian Academy of Sciences, Budapest 1364, P. O. Box 127 and Dept. of ...

The precise identification of light verb constructions is crucial for the successful functioning of several NLP applications. In order to facilitate the development of an algorithm that is capable of recognizing them, a manually annotated corpus of light verb constructions has been built for Hungarian. Basic annotation guidelines and statistical data on the corpus are also presented in the pape...

In 1955. H.W.Huhn published the Hungarian algorithm, the first polynomial-time algorithm for the assignment problem. In the next fifty years assignment problems attracted hundreds of researchers. Their studies accompanied and sometimes anticipated the development of Combinatorial Optimization, producing fundamental contributions to all algorithmic techniques in use nowadays. This talk is based ...

We have proved a new rotational sorting algorithm capable of reducing the complexity of data assignment process embedded in the maximum likelihood (ML)-based solution of a multitarget tracking problem from O(N3) of the conventional Hungarian type routines to O(N2) provided that the bearings-only measurements from an array of passive sensors are free from cluttering and missing data. © 2001 IMAC...

This report describes the process of creating a pronunciation dictionary and phonological lexicon for Hungarian for the purpose of aiding in linguistic research on Hungarian phonology and phonotactics. The pronunciation dictionary was created by transforming orthographic forms to pronunciation representations by taking advantage of systematic deviations between Hungarian orthography and pronunc...

is called Thue equation in honour of A. Thue, who proved in 1909 [19] that the number of its solutions in integers is finite. Thue’s result is not effective, but in 1968, A. Baker [1] gave an upper bound for the solutions using his lower bounds for linear forms in logarithms of algebraic numbers. Since then, algorithms for the solution of single Thue equations have been ∗This work was supported...

In this paper we discuss the parallel asynchronous implementation of the Hungarian method for solving the classical assignment problem. Multiple augmentations and price rises are simultaneously attempted starting from several unassigned sources and using possibly outdated price and assignment information. The results are then merged asynchronously subject to rather weak compatibility conditions...

In this paper, we propose a semi-supervised cluster-and-label algorithm for utterance classification. The approach assumes that the underlying class distribution is roughly captured through– fully unsupervised–clustering. Then, a minimum number of labeled examples is used to automatically label the extracted clusters so that the initial label set is ”augmented” to the whole clustered data. The ...