We describe a branch and bound algorithm for an assignment problem subject to a special set of side constraints. The problem has application in the design of tool carousels for certain flexible manufacturing systems. The resulting model represents a special case of the restricted facilities layout problem in which it is forbidden to locate any facility in certain zones. The bounds for the algor...

In this paper, a fast automatic NP alignment technique developed for MetaMorpho TM is presented. MetaMorpho TM is an EBMT-based translation memory that stores not only full sentence pairs but also NP pairs in its database of translations. In order to fulfill speed requirements of a translation memory (segments have to be stored quickly), in the proposed NP alignment algorithm time consuming sta...

We present a knowledge-based coreference resolution system for noun phrases in Hungarian texts. The system is used as a module in an automated psychological text processing project. Our system uses rules that rely on knowledge from the morphological, syntactic and semantic output of a deep parser and semantic relations form the Hungarian WordNet ontology. We also use rules that rely on Binding ...

Our paper reports an attempt to apply an unsupervised clustering algorithm to a Hungarian treebank in order to obtain semantic verb classes. Starting from the hypothesis that semantic metapredicates underlie verbs’ syntactic realization, we investigate how one can obtain semantically motivated verb classes by automatic means. The 150 most frequent Hungarian verbs were clustered on the basis of ...

In this paper, an adaptive subcarrier assignment method based on a stable matching algorithm is considered. From the performance comparison with other assignment methods (Hungarian-algorithm-based, contiguous and interleaved), our assignment method, while of relatively low complexity, resulted in a satisfactory performance in terms of per-ONU and overall achievable throughputs, and also it resp...

There is a frequent need to compute medial shape representations of each of a group of structures, e.g. for use in a medical study of anatomical shapes. We present a novel approach to skeletonization that leverages information provided from such a group. We augment the traditional medial axis transform with an additional coordinate stored at each medial locus, indicating the confidence that the...

Implicit in the k –means algorithm is a way to assign value, or utility, cluster of points. It works by taking centroid points and value sum distances from each point cluster. The aim this paper introduce an alternative Motivation provided. Moreover, whereas does not have natural determine if it unknown, we can use our method evaluating find good clusters sequential manner. idea uses optimizati...