2463 search results - page 226 / 493 » Rankings of Directed Graphs |
152
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
127
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
120
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
122
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
143
Voted
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...