In 1955 H. W. Kuhn 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...

A promising trend in content based image retrieval (CBIR) is the incorporation of the notion of objects into the similarity evaluation. Images are automatically segmented into a dynamic number of regions that roughly correspond to objects. In region based image retrieval (RBIR), we compute standard feature characteristic atop those segments and evaluate the similarity between images based on th...

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 Gro...

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...

We propose a novel method for detecting optional arguments of Hungarian verbs using only positive data. We introduce a custom variant of collexeme analysis that explicitly models the noise in verb frames. Our method is, for the most part, unsupervised: we use the spectral clustering algorithm described in Brew and Schulte in Walde (2002) to build a noise model from a short, manually verified se...

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...

In this article, we describe the machine translation systems we used to create MorphoLogic’s submissions to the WMT09 shared Hungarian to English and English to Hungarian shared translation tasks. We used our rule based MetaMorpho system to generate our primary submission. In addition, we created a hybrid system where the Moses decoder is used to rank translations or assemble partial translatio...

The long, medium and short term planning of Hungarian backbone and Budapest trunk networks in Hungarian Telecom are based on the software package PLANET, which covers a wide range of the transmission planning activities. The paper describes the PDH and SDH network planning tools, the planning processes and the resulted networks. Main present features of Hungarian backbone and Budapest trunk net...

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...