Sciweavers

474 search results - page 19 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
ICIP
2009
IEEE
16 years 3 months ago
Non-local Image Smoothing By Applying Anisotropic Diffusion Pde's In The Space Of Patches
We design a family of non-local image smoothing algorithms which approximate the application of diffusion PDE's on a specific Euclidean space of image patches. We first map a...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 21 days ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
MOBIHOC
2002
ACM
16 years 2 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
FIMH
2009
Springer
15 years 9 months ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...
ICPR
2008
IEEE
16 years 4 months ago
K-means clustering of proportional data using L1 distance
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...