344 search results - page 57 / 69 » Random Walks on Colored Graphs |
TMM
2010
13 years 2 months ago
2010
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
AIPR
2008
IEEE
13 years 9 months ago
2008
IEEE
We present an agent-based full body tracking and 3D animation system to generate motion data using stereo calibrated cameras. The novelty of our approach is that agents are bound t...
GD
1995
Springer
13 years 11 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...