Sciweavers

6181 search results - page 464 / 1237
» Transactional Cluster Computing
Sort
View
PR
2008
170views more  PR 2008»
15 years 6 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
17 years 2 months ago
Sparse Subspace Clustering
We propose a method based on sparse representation (SR) to cluster data drawn from multiple low-dimensional linear or affine subspaces embedded in a high-dimensional space. Our ...
Ehsan Elhamifar, René Vidal
CVPR
2004
IEEE
16 years 9 months ago
Bayesian Face Recognition Using Support Vector Machine and Face Clustering
In this paper, we first develop a direct Bayesian based Support Vector Machine by combining the Bayesian analysis with the SVM. Unlike traditional SVM-based face recognition metho...
Zhifeng Li, Xiaoou Tang
CVPR
2005
IEEE
16 years 9 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 8 months ago
Approximate Clustering on Distributed Data Streams
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
Qi Zhang, Jinze Liu, Wei Wang 0010