نتایج جستجو برای: hungarian algorithm
تعداد نتایج: 761429 فیلتر نتایج به سال:
The increasing interest in the investigation of social behaviours of a group of animals has heightened the need for developing tools that provide robust quantitative data. Drosophila melanogaster has emerged as an attractive model for behavioural analysis; however, there are still limited ways to monitor fly behaviour in a quantitative manner. To study social behaviour of a group of flies, acqu...
Aiming to create verb paraphrases to lay the foundation of sentence paraphrases I automatically created Hungarian semantic verb classes with k-means algorithm. The vector representation of verbs was special: dimensions were cases and values were sets of lemmas that can fill the verb frame position defined by the case. I clustered 900 frequent verbs, from which 243 got into 71 smaller clusters, ...
In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not h...
The ParaMor algorithm for unsupervised morphology induction, which competed in the 2007 and 2008 Morpho Challenge competitions, does not assign a numeric score to its segmentation decisions. Scoring each character boundary in each word with the likelihood that it falls at a true morpheme boundary would allow ParaMor to adjust the confidence level at which the algorithm proposes segmentations. A...
The motivations for deploying energy and spectral-efficient network architectures are the high consumption need more spectral resources in modern cellular networks. key method to solve efficiency EE maximization problem of downlink non-orthogonal multiple access (NOMA)-based massive MIMO system is decouple it into user pairing efficient power allocation problems. This work studies performance t...
This work addresses the problem of non-rigid registration between two 2D or 3D points sets as a novel application of Relevance Vector Machines (RVM). An iterative framework is proposed which consists of two steps: at first, correspondences between distinct points are estimated by the Hungarian algorithm and then a regression procedure based on a Bayesian linear model (RVM) maps the two sets of ...
We consider the decomposition of a series of spectra such as those acquired in photoelectron spectroscopy [16]: the data consist of several spectra acquired at different times. The peaks in the spectra are assumed to be Gaussian with positive amplitudes and their characteristics vary slowly between two consecutive spectra. This work aims at estimating the peak parameters and their evolution to ...
It is a fundamental decision making process in container terminals to allocate container transporting works among ALVs. Nowadays, container terminals tend to be larger in storage space and more efficient in handling. As a result, estimations of ALV travel times could be inaccurate, the scale of ALV work allocation could be quite large, and a fixed handling sequence could be hardly ensured befor...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید