Sciweavers

1629 search results - page 182 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CVPR
2004
IEEE
16 years 4 days ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ICASSP
2007
IEEE
15 years 4 months ago
Discriminative Gaussian Mixtures for Interactive Image Segmentation
Recently graph-cut optimization has been extensively explored for interactive image segmentation. In this paper we propose Discriminative Gaussian Mixtures (DGMs) to boost the per...
Jue Wang
93
Voted
FSTTCS
2001
Springer
15 years 2 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
DAC
1995
ACM
15 years 1 months ago
Rephasing: A Transformation Technique for the Manipulation of Timing Constraints
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
Miodrag Potkonjak, Mani B. Srivastava