Sciweavers

648 search results - page 47 / 130
» Lowness for Demuth Randomness
Sort
View
ICALP
2007
Springer
15 years 10 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
EDBT
2009
ACM
173views Database» more  EDBT 2009»
15 years 9 months ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
ICDAR
1999
IEEE
15 years 9 months ago
A Two-state Markov Chain Model of Degraded Document Images
We propose a two-state Markov chain model of degraded document images. The model generates random and burst noise to simulate isolated pixel reversal as well as blurring of a larg...
Shamik Sural, P. K. Das
ASPDAC
2007
ACM
133views Hardware» more  ASPDAC 2007»
15 years 8 months ago
Modeling Sub-90nm On-Chip Variation Using Monte Carlo Method for DFM
- For sub-90nm technology nodes and below, random fluctuations of within-die physical process properties are also known as random on-chip variation (OCV). It impacts on the VLSI/So...
Jun-Fu Huang, Victor C. Y. Chang, Sally Liu, Kelvi...
DMIN
2007
76views Data Mining» more  DMIN 2007»
15 years 6 months ago
Towards Average Case Analysis of Itemset Mining
—We perform a statistical analysis and describe the asymptotic behavior of the frequency and size distribution of δoccurrent, minimal δ-occurrent, and maximal δ-occurrent item...
Dan Singer, David J. Haglin, Anna M. Manning