Sciweavers

101 search results - page 14 / 21
» Graph Partition by Swendsen-Wang Cuts
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 9 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
DAGM
2007
Springer
14 years 2 months ago
WarpCut - Fast Obstacle Segmentation in Monocular Video
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...
Andreas Wedel, Thomas Schoenemann, Thomas Brox, Da...
COLT
2007
Springer
14 years 2 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
CVPR
2005
IEEE
14 years 10 months ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 3 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton