Sciweavers

670 search results - page 50 / 134
» Intractability and clustering with constraints
Sort
View
4OR
2004
90views more  4OR 2004»
14 years 9 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
CVPR
2004
IEEE
15 years 11 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade
ICASSP
2009
IEEE
15 years 4 months ago
Exploring functional connectivity in fMRI via clustering
In this paper we investigate the use of data driven clustering methods for functional connectivity analysis in fMRI. In particular, we consider the K-Means and Spectral Clustering...
Archana Venkataraman, Koene R. A. Van Dijk, Randy ...
WACV
2005
IEEE
15 years 3 months ago
Image Segmentation by Unsupervised Sparse Clustering
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
Byoung-Ki Jeon, Yun-Beom Jung, Ki-Sang Hong
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 7 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...