1830 search results - page 142 / 366 » Workshop on Graph Computation Models |
169
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
137
click to vote
ISTCS
1993
Springer
15 years 8 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
143
click to vote
SIGCOMM
2006
ACM
15 years 10 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
134
Voted
APPML
2007
15 years 4 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
211
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...