Sciweavers

581 search results - page 13 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
CIDM
2007
IEEE
14 years 4 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...
WAIM
2007
Springer
14 years 4 months ago
Distributed, Hierarchical Clustering and Summarization in Sensor Networks
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...
Xiuli Ma, Shuangfeng Li, Qiong Luo, Dongqing Yang,...
ICIP
2002
IEEE
14 years 11 months ago
Real-time reconstruction of wavelet encoded meshes for view-dependent transmission and visualization
Wavelet methods for geometry encoding is a recently emerged superset of multiresolution analysis which has proven to be very efficient in term of compression and adaptive transmis...
Patrick Gioia, Oliver Aubault, Christian Bouville
CGF
2010
174views more  CGF 2010»
13 years 10 months ago
Bidirectional Texture Function Compression Based on Multi-Level Vector Quantization
The Bidirectional Texture Function (BTF) is becoming widely used for accurate representation of real-world material appearance. In this paper a novel BTF compression model is prop...
Vlastimil Havran, J. Filip, Karol Myszkowski
ICDM
2009
IEEE
133views Data Mining» more  ICDM 2009»
14 years 4 months ago
On K-Means Cluster Preservation Using Quantization Schemes
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...
Deepak S. Turaga, Michail Vlachos, Olivier Versche...