Sciweavers

2735 search results - page 36 / 547
» Comparing notions of randomness
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
ICALP
2007
Springer
14 years 1 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
LREC
2008
153views Education» more  LREC 2008»
13 years 9 months ago
Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
Linus Sellberg, Arne Jönsson
CISS
2011
IEEE
12 years 11 months ago
Noisy network coding approach to the relay channel with a random state
—We consider the three-node relay channel with a random state. We assume that noncausal knowledge of the random state is partially known at the nodes. We present an achievable ra...
Majid Nasiri Khormuji, Mikael Skoglund
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
14 years 8 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan