Sciweavers

84 search results - page 5 / 17
» Computing Clusters of Correlation Connected Objects
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 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

Presentation
956views
12 years 1 months ago
A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...
CG
2005
Springer
13 years 7 months ago
A freehand sketching interface for progressive construction of 3D objects
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
Mark Masry, Dong Joong Kang, Hod Lipson
CVPR
2004
IEEE
14 years 10 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
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...