Sciweavers

2754 search results - page 60 / 551
» Distributed Weighted Matching
Sort
View
MOR
2007
138views more  MOR 2007»
13 years 9 months ago
The Demand-Matching Problem
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
F. Bruce Shepherd, Adrian Vetta
ICS
2000
Tsinghua U.
14 years 1 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
ICIP
2005
IEEE
14 years 11 months ago
Exploiting discriminant information in elastic graph matching
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
Stefanos Zafeiriou, Anastasios Tefas, Ioannis Pita...
CVPR
2010
IEEE
14 years 4 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio