Sciweavers

327 search results - page 63 / 66
» Algorithms for infinite huffman-codes
Sort
View
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
14 years 7 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
POPL
2008
ACM
14 years 7 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
SIGMOD
2004
ACM
209views Database» more  SIGMOD 2004»
14 years 6 months ago
MAIDS: Mining Alarming Incidents from Data Streams
Real-time surveillance systems, network and telecommunication systems, and other dynamic processes often generate tremendous (potentially infinite) volume of stream data. Effectiv...
Y. Dora Cai, David Clutter, Greg Pape, Jiawei Han,...
CBMS
2007
IEEE
14 years 1 months ago
Influence of Dictionary Size on the Lossless Compression of Microarray Images
A key challenge in the management of microarray data is the large size of images that constitute the output of microarray experiments. Therefore, only the expression values extrac...
Robert Bierman, Rahul Singh
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 8 months ago
Intrinsically Universal Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Nicolas Ollinger