1664 search results - page 72 / 333 » Distance labeling in graphs |
141
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We propose a novel face image similarity measure based on Hausdorff distance (HD). In contrast to conventional HD-based measures, which are generally applied in the image space (s...
145
Voted
RSA
2011
14 years 6 months ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
150
click to vote
TCS
2010
15 years 2 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
145
click to vote
EMMCVPR
1997
Springer
15 years 8 months ago
1997
Springer
Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local ...
130
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...