Key members: Péter Horváth [1] Zoltán Kató [2] Founded by: Hungarian Science and Technology Foundation (TET), Hungarian-French Cooperation (Balaton) [3] Hungarian Scientific Research Fund (OTKA) [4] European Union FP5 project IMAVIS PhD Scholarship of the Doctoral School in Mathematics and Computer Science of the University of Szeged [5] PhD Scholarship of the French Government Partners: Ariana...

Key members: Péter Horváth [1] Zoltán Kató [2] Founded by: Hungarian Science and Technology Foundation (TET), Hungarian-French Cooperation (Balaton) [3] Hungarian Scientific Research Fund (OTKA) [4] European Union FP5 project IMAVIS PhD Scholarship of the Doctoral School in Mathematics and Computer Science of the University of Szeged [5] PhD Scholarship of the French Government Partners: Ariana...

The paper reports on the development of the Hungarian Gigaword Corpus, an extended new edition of the Hungarian National Corpus, with upgraded and redesigned linguistic annotation and an increased size of 1.5 billion tokens. Issues concerning the standard steps of corpus collection and preparation are discussed with special emphasis on linguistic analysis and annotation due to Hungarian having ...

Key members: Péter Horváth [1] Zoltán Kató [2] Founded by: Hungarian Science and Technology Foundation (TET), Hungarian-French Cooperation (Balaton) [3] Hungarian Scientific Research Fund (OTKA) [4] European Union FP5 project IMAVIS PhD Scholarship of the Doctoral School in Mathematics and Computer Science of the University of Szeged [5] PhD Scholarship of the French Government Partners: Ariana...

Key members: Péter Horváth [1] Zoltán Kató [2] Founded by: Hungarian Science and Technology Foundation (TET), Hungarian-French Cooperation (Balaton) [3] Hungarian Scientific Research Fund (OTKA) [4] European Union FP5 project IMAVIS PhD Scholarship of the Doctoral School in Mathematics and Computer Science of the University of Szeged [5] PhD Scholarship of the French Government Partners: Ariana...

The Hungarian method is an e cient algorithm for nding a minimal cost perfect matching in a weighted bipartite graph. This paper describes an e cient algorithm for nding all minimal cost perfect matchings. The computational time required to generate each additional perfect matching is O(n(n + m)); and it requires O(n+m) memory storage. This problem can be solved by algorithms for nding the Kth-...

Within a contemporary Hungarian literary discourse that emphasized national values, the first international journal of comparative literature, Acta Comparationis Litterarum Universarum (ACLU) proved quite incomprehensible. I therefore argue that ACLU’s aims and constant struggles are better understood from the viewpoint of its authors originating from beyond Hungary, such as that held by the En...

A new relay selection and resource allocation scheme for cognitive two-way relay networks based on bipartite matching algorithm is proposed in this work. We assume a primarysecondary network such that both primary and secondary users utilize the licensed spectrum, simultaneously. In this scenario, some of cognitive radio (CR) nodes are selected by matching algorithm as relays to provide a bidir...