Sciweavers

98 search results - page 13 / 20
» Achieving anonymity via clustering
Sort
View
CCGRID
2006
IEEE
15 years 5 months ago
Towards Soft Real-Time Applications on Enterprise Desktop Grids
— Desktop grids use the idle cycles of desktop PC’s to provide huge computational power at low cost. However, because the underlying desktop computing resources are volatile, a...
Derrick Kondo, Bruno Kindarji, Gilles Fedak, Franc...
DICTA
2003
15 years 10 days ago
Robust Estimation in Gaussian Mixtures Using Multiresolution Kd-trees
For many applied problems in the context of clustering via mixture models, the estimates of the component means and covariance matrices can be affected by observations that are at...
Shu-Kay Ng, Geoffrey J. McLachlan
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
15 years 8 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
SMI
2006
IEEE
183views Image Analysis» more  SMI 2006»
15 years 5 months ago
The Generalized Shape Distributions for Shape Matching and Analysis
This paper presents a novel 3D shape descriptor "The Generalized Shape Distributions" for effective shape matching and analysis, by taking advantage of both local and gl...
Yi Liu, Hongbin Zha, Hong Qin
SC
2004
ACM
15 years 4 months ago
A Parallel Implementation of 4-Dimensional Haralick Texture Analysis for Disk-Resident Image Datasets
Texture analysis is one possible method to detect features in biomedical images. During texture analysis, texture related information is found by examining local variations in ima...
Brent Woods, Bradley D. Clymer, Joel H. Saltz, Tah...