Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
515
The Hungarian method for the assignment problem
- Naval Res. Logist. Quart
, 1955
"... Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work ..."
Abstract
-
Cited by 1259 (0 self)
- Add to MetaCart
in the work of two Hungarian mathematicians may be exploited to yield a new method of solving this problem. 1.
A hierarchical clustering algorithm based on the hungarian method
- Pattern Recognition Letter
"... We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient algorithm for solving the problem of minimal-weight cycle cover. We utilize the Hungarian method as the basic building b ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient algorithm for solving the problem of minimal-weight cycle cover. We utilize the Hungarian method as the basic building
Applying the Hungarian Method to Stereo Matching
- In Proc. 1997 IEEE Conference on Decision and Control
, 1997
"... The correspondence problem in stereo vision is to calculate matches between pixels (points) or features (e.g., lines) in stereo images. The method of calculating these matches over an entire stereo image pair usually depends upon the application for which the resulting depth information will be used ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
The correspondence problem in stereo vision is to calculate matches between pixels (points) or features (e.g., lines) in stereo images. The method of calculating these matches over an entire stereo image pair usually depends upon the application for which the resulting depth information
Parallel Asynchronous Hungarian Methods For The Assignment Problem
- ORSA J. ON COMPUTING
, 1993
"... In this paper we discuss the parallel asynchronous implementation of the Hungarian method for solving the classical assignment problem. Multiple augmentations and price rises are simultaneously attempted starting from several unassigned sources and using possibly outdated price and assignment inform ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
In this paper we discuss the parallel asynchronous implementation of the Hungarian method for solving the classical assignment problem. Multiple augmentations and price rises are simultaneously attempted starting from several unassigned sources and using possibly outdated price and assignment
SPONSORED SEARCH, MARKET EQUILIBRIA, AND THE HUNGARIAN METHOD
, 2010
"... Two-sided matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market where n advertisers compete for the assignment of one of k sponsored search results, also known as “slots”, for certain keywords they are interested in. Here, as in ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
, as in other markets of that kind, market equilibria correspond to stable matchings. In this paper, we show how to modify Kuhn’s Hungarian Method (Kuhn, 1955) so that it finds an optimal stable matching between advertisers and advertising slots in settings with generalized linear utilities, per
On Kuhn’s Hungarian Method -- A Tribute From Hungary
, 2004
"... Harold W. Kuhn, in his celebrated paper entitled The Hungarian Method for the assignment problem, [Naval Research Logistic Quarterly, 2 (1955), pp. 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph. In his delightful reminescences [18], Kuhn explai ..."
Abstract
-
Cited by 17 (0 self)
- Add to MetaCart
Harold W. Kuhn, in his celebrated paper entitled The Hungarian Method for the assignment problem, [Naval Research Logistic Quarterly, 2 (1955), pp. 83-97] described an algorithm for constructing a maximum weight perfect matching in a bipartite graph. In his delightful reminescences [18], Kuhn
The Hungarian Method in a Mixed Matching Market
, 2005
"... We present an algorithm that computes a stable matching in a common generalization of the marriage and the assignment game in O(n^4) time. ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We present an algorithm that computes a stable matching in a common generalization of the marriage and the assignment game in O(n^4) time.
MDSM: Microarray Database Schema Matching Using the Hungarian Method
, 2006
"... Current microarray databases use different terminologies and structures and thereby limit the sharing of data and collating of results between laboratories. Consequently, an effective integrated microarray data model is required. One important process to develop such an integrated database is schema ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
microarray ontology to improve the measuring accuracy of the similarity between attributes. The similarity relations can be represented as weighted bipartite graphs. We determine the best schema matching by computing the optimal matching in a bipartite graph using the Hungarian optimisation method
Results 1 - 10
of
515
