Sciweavers

220 search results - page 11 / 44
» A Pseudo-Metric for Weighted Point Sets
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 10 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
ICDAR
2011
IEEE
12 years 8 months ago
Symbol Recognition by Multiresolution Shape Context Matching
—We present a multiresolution scheme for symbol representation and recognition based on statistical shape features. We define a symbol as a set of shape points, each of which is...
Feng Su, Tong Lu, Ruoyu Yang
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
14 years 18 hour ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
ICIP
2008
IEEE
14 years 2 months ago
Reliable interest point detection under large illumination variations
This appendix proves the illumination robustness of the proposed corner detector over the Harris corner detector. I. HARRIS CORNER DETECTOR The Harris corner detector [1] is based...
Murat Gevrekci, Bahadir K. Gunturk
ICPR
2010
IEEE
13 years 8 months ago
Improved Mean Shift Algorithm with Heterogeneous Node Weights
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Ji Won Yoon, Simon P. Wilson