Sciweavers

930 search results - page 39 / 186
» Model compression
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Fast bayesian compressive sensing using Laplace priors
In this paper we model the components of the compressive sensing (CS) problem using the Bayesian framework by utilizing a hierarchical form of the Laplace prior to model sparsity ...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
ICML
2008
IEEE
16 years 19 days ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
ICMLA
2008
15 years 1 months ago
Prediction-Directed Compression of POMDPs
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
CGF
2006
72views more  CGF 2006»
14 years 12 months ago
GEncode: Geometry-driven compression for General Meshes
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...
Thomas Lewiner, Marcos Craizer, Hélio Lopes...
CRYPTO
2004
Springer
139views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
How to Compress Rabin Ciphertexts and Signatures (and More)
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...
Craig Gentry