76 search results - page 5 / 16 » Judicious partitions of directed graphs |
AAAI
2008
13 years 12 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
CVPR
2006
IEEE
14 years 11 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...
CVPR
2012
IEEE
12 years 1 days 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...
ISSS
1997
IEEE
14 years 1 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
SC
1993
ACM
14 years 1 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...