Sciweavers

175 search results - page 10 / 35
» Bounds for Permutation Rate-Distortion
Sort
View
SDM
2010
SIAM
166views Data Mining» more  SDM 2010»
13 years 9 months ago
A Permutation Approach to Validation
We give a permutation approach to validation (estimation of out-sample error). One typical use of validation is model selection. We establish the legitimacy of the proposed permut...
Malik Magdon-Ismail, Konstantin Mertsalov
IPL
2011
94views more  IPL 2011»
12 years 11 months ago
Lower bounds for context-free grammars
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
Yuval Filmus
JCT
2010
65views more  JCT 2010»
13 years 6 months ago
Multiple cross-intersecting families of signed sets
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...
Peter Borg, Imre Leader
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 6 months ago
Rate-distortion function via minimum mean square error estimation
Abstract—We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integr...
Neri Merhav
TCBB
2011
13 years 2 months ago
Information-Theoretic Model of Evolution over Protein Communication Channel
—In this paper, we propose a communication model of evolution and investigate its information-theoretic bounds. The process of evolution is modeled as the retransmission of infor...
Liuling Gong, Nidhal Bouaynaya, Dan Schonfeld