922 search results - page 32 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
100
click to vote
TIT
2002
15 years 1 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
141
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
140
click to vote
CSFW
2012
IEEE
13 years 4 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
100
click to vote
ENTCS
2007
15 years 1 months ago
2007
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
ECCC
2010
15 years 2 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...