Sciweavers

2754 search results - page 105 / 551
» Distributed Weighted Matching
Sort
View
COCOON
2009
Springer
14 years 5 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 5 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
IPL
2008
104views more  IPL 2008»
13 years 11 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
ICASSP
2011
IEEE
13 years 2 months ago
The grouped two-sided orthogonal Procrustes problem
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
Bryan R. Conroy, Peter J. Ramadge
ICIAP
2007
ACM
14 years 5 months ago
Robust Face Matching Under Large Occlusions
Outliers due to occlusions and contrast and offset signal deviations notably hinder recognition and retrieval of facial images. We propose a new maximum likelihood matching score ...
Georgy L. Gimel'farb, Patrice Delmas, John Morris,...