Sciweavers

2031 search results - page 11 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
92
Voted
ALGORITHMICA
2010
122views more  ALGORITHMICA 2010»
14 years 11 months ago
Faster Algorithms for Stable Allocation Problems
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
Brian C. Dean, Siddharth Munshi
PAMI
2008
109views more  PAMI 2008»
14 years 11 months ago
Likelihood Ratio-Based Biometric Score Fusion
Multibiometric systems fuse information from different sources to compensate for the limitations in performance of individual matchers. We propose a framework for optimal combinati...
Karthik Nandakumar, Yi Chen, Sarat C. Dass, Anil K...
92
Voted
DAM
2010
92views more  DAM 2010»
14 years 11 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
DCC
1998
IEEE
14 years 11 months ago
Joint Source Channel Matching for a Wireless Communications Link
: Application of joint source-channel matching in heterogeneous multi-media environments will demand general source-channel optimization schemes suitable for a wide variety of sour...
Swaroop Appadwedula, Douglas L. Jones, Kannan Ramc...
ECCV
2010
Springer
15 years 4 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...