9886 search results - page 73 / 1978 » Learning Compressible Models |
103
click to vote
INFOCOM
2012
IEEE
13 years 9 days ago
2012
IEEE
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
We propose an efficient algorithm for principal component analysis (PCA) that is applicable when only the inner product with a given vector is needed. We show that Krylov subspace...
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
CGF
2006
14 years 10 months ago
2006
Performances of actual mesh compression algorithms vary significantly depending on the type of model it encodes. These methods rely on prior assumptions on the mesh to be efficient...
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...