Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} be two sets of objects with s + r = n, the generalized assignment problem assigns each element ai ∈ A to at least αi and at most α ′ i elements in B, and each element bj ∈ B to at least βj and at most β ′ j elements in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem using th...

The 2012 Public Act on Education in Hungary made daily physical education (PE) a mandatory part of the school day starting in the 2012-2013 school year. This directive was linked to a significant reorganization of the Hungarian education system including a new National Core Curriculum that regulates the objectives and contents of PE. The Hungarian School Sport Federation (HSSF) recognized the o...

The goal of a Hungarian research project has been to create an integrated Hungarian natural language processing framework. This infrastructure includes tools for analyzing Hungarian texts, integrated into a standardized environment. The morphological analyzer is one of the core components of the framework. The goal of this paper is to describe a fast and customizable morphological analyzer and ...

This paper addresses the cooperation problem for a team of mobile robots in adversarial environments. Considering the mutual influence among the robots, two key factors are defined: the impact factor and the suffering factor. A stochastic assignment model is built, based on the geometric topology of the targets, through which the robots can exhibit temporal cooperation. To reduce computational ...

This paper aims to make up for the lack of documented baselines for Hungarian language modeling. Various approaches are evaluated on three publicly available Hungarian corpora. Perplexity values comparable to models of similar-sized English corpora are reported. A new, freely downloadable Hungarian benchmark corpus is introduced.

In this paper we present an experiment to automatically generate annotated training corpora for a supervised word sense disambiguation module operating in an English-Hungarian and a Hungarian-English machine translation system. Training examples for the WSD module are produced by annotating ambiguous lexical items in the source language (words having several possible translations) with their pr...

ModuLand plug-in for Cytoscape: An algorithm for the determination of extensively overlapping modules, community centrality and its use in biological networks Máté Szalay-Bekő and Robin Palotai, Balázs Szappanos, István A. Kovács, Balázs Papp and Peter Csermely Department of Medical Chemistry, Semmelweis University, Budapest, Hungary Evolutionary Systems Biology Group, Biological Research Centr...

The distribution of a set of goods (such as finite allowed numbers of electronic goods, physical objects or fixed roles in an organization) amongst a set of agents with varying preferences is a complex combinatorial problem. While algorithms such as the Hungarian method exist to solve this type of Assignment Problem, these rely on central allocation with complete information about preferences, ...

In this paper, we study texture metamorphosis, or how to generate texture samples that smoothly transform from a source texture image to a target. We propose a patternbased approach to specify the feature correspondence between two textures, based on the observation that many texture images have stochastically distributed patterns which are similar to each other. First, the user selects a patte...