829 search results - page 72 / 166 » Distance domination-critical graphs |
100
click to vote
APJOR
2010
15 years 22 hour ago
2010
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
111
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
121
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...