Sciweavers

586 search results - page 20 / 118
» Adaptive Online Data Compression
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
14 years 1 days ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
ICPR
2002
IEEE
14 years 9 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
SUTC
2008
IEEE
14 years 2 months ago
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different typ...
Vasanth Iyer, Rammurthy Garimella, M. B. Srinivas
TWC
2010
13 years 3 months ago
Efficient Measurement Generation and Pervasive Sparsity for Compressive Data Gathering
We proposed compressive data gathering (CDG) that leverages compressive sampling (CS) principle to efficiently reduce communication cost and prolong network lifetime for large scal...
Chong Luo, Feng Wu, Jun Sun, Chang Wen Chen
GREC
2003
Springer
14 years 1 months ago
User Adaptation for Online Sketchy Shape Recognition
This paper presents a method of online sketchy shape recognition that can adapt to different user sketching styles. The adaptation principle is based on incremental active learning...
Zhengxing Sun, Liu Wenyin, Binbin Peng, Bin Zhang,...