2310 search results - page 306 / 462 » Coloring Random Graphs |
SIAMCOMP
2010
13 years 6 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
MIR
2006
ACM
14 years 2 months ago
2006
ACM
The variety of features available to represent multimedia data constitutes a rich pool of information. However, the plethora of data poses a challenge in terms of feature selectio...
WEBI
2005
Springer
14 years 1 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...