43 search results - page 2 / 9 » Faster and Better Spectral Algorithms for Multi-Way Partitio... |
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
ICCAD
1996
IEEE
13 years 9 months ago
1996
IEEE
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
CVPR
2012
IEEE
11 years 7 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...