In this paper, we address the general case of a coordinated secondary network willing to exploit communication opportunities left vacant by a licensed primary network. Since secondary users (SU) usually have no prior knowledge on the environment, they need to learn the availability of each channel through sensing techniques, which however can be prone to detection errors. We argue that cooperat...

In this paper we have proposed a semiheuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/service facilities. Our proposed algorithm marries the wellknown CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, our algorithm is likely to be more efficient in terms of...

In this paper we have proposed a semi-heuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/service facilities. Our proposed algorithm marries the well-known CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, our algorithm is likely to be more efficient in terms ...

Bipartite graph matching algorithms become more and more popular to solve error-correcting graph matching problems and to approximate the graph edit distance of two graphs. However, the memory requirements and execution times of this method are respectively proportional to (n + m) and (n + m) where n and m are the order of the graphs. Subsequent developments reduced these complexities. However,...

This paper presents a method for the syntactic parsing of Hungarian natural language texts using a machine learning approach. This method learns tree patterns with various phrase types described by regular expressions from an annotated corpus. The PGS algorithm, an improved version of the RGLearn method, is developed and applied as a classifier in classifier combination schemas. Experiments sho...

We present a statistical decision approach for the point set matching of unordered feature sets. Both feature sets have associated uncertainties, and the number of elements in each set may be different. Computation of the match likelihood requires a correspondence between feature sets; we solve the correspondence problem in polynomial time using the Hungarian algorithm. We also consider the pro...

Consider a set-classification task where c objects must be labelled simultaneously in c classes, knowing that there is only one object coming from each class (full-class set). Such problems may occur in automatic attendance registration systems, simultaneous tracking of fast moving objects and more. A Bayes-optimal solution to the full-class set classification problem is proposed using a single...

Deterministic loading of single atoms onto arbitrary two-dimensional lattice points has recently been demonstrated, where by dynamically controlling the optical-dipole potential, atoms from a probabilistically loaded lattice were relocated to target lattice points to form a zero-entropy atomic lattice. In this atom rearrangement, how to pair atoms with the target sites is a combinatorial optimi...

Hanc commentationem in medium protulerunt S. Cohn et C.W. Borchardt e manuscriptis posthumis Caroli G. J. Jacobi. Variæ formæ canonicæ quas datum systema æquationum differentialium vulgarium inducere potest considerantur. Investigatio ordinis systematis, sine formæ canonicæ auxilio, ad solvendum problema inæqualitatum reducitur: affectationum problema. Novum genus formularum, determinantia manc...

We propose a technique to generate nonprojective word orders in an efficient statistical linearization system. Our approach predicts liftings of edges in an unordered syntactic tree by means of a classifier, and uses a projective algorithm for tree linearization. We obtain statistically significant improvements on six typologically different languages: English, German, Dutch, Danish, Hungarian,...