Sciweavers

53 search results - page 6 / 11
» How to Strengthen Pseudo-random Generators by Using Compress...
Sort
View
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
13 years 11 months 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 8 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
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 8 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
DCC
2010
IEEE
14 years 2 months ago
On the Systematic Measurement Matrix for Compressed Sensing in the Presence of Gross Errors
Inspired by syndrome source coding using linear error-correcting codes, we explore a new form of measurement matrix for compressed sensing. The proposed matrix is constructed in t...
Zhi Li, Feng Wu, John Wright
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 8 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...