Sciweavers

2600 search results - page 2 / 520
» Clustering with or without the Approximation
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 5 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
VC
2008
138views more  VC 2008»
13 years 5 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh
BROADNETS
2004
IEEE
13 years 9 months ago
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
Murat Demirbas, Anish Arora, Vineet Mittal, Vinod ...
BIOINFORMATICS
2007
190views more  BIOINFORMATICS 2007»
13 years 5 months ago
Towards clustering of incomplete microarray data without the use of imputation
Motivation: Clustering technique is used to find groups of genes that show similar expression patterns under multiple experimental conditions. Nonetheless, the results obtained by...
Dae-Won Kim, Ki Young Lee, Kwang H. Lee, Doheon Le...