Sciweavers

716 search results - page 52 / 144
» Algorithmic Issues in Coding Theory
Sort
View
116
Voted
IH
2007
Springer
15 years 8 months ago
Exploiting Security Holes in Lattice Data Hiding
Abstract. This paper presents a security analysis for data hiding methods based on nested lattice codes, extending the analysis provided by previous works. The security is quanti...
Luis Pérez-Freire, Fernando Pérez-Go...
160
Voted
JMLR
2010
163views more  JMLR 2010»
14 years 9 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
136
Voted
CIKM
2011
Springer
14 years 2 months ago
SIMD-based decoding of posting lists
Powerful SIMD instructions in modern processors offer an opportunity for greater search performance. In this paper, we apply these instructions to decoding search engine posting ...
Alexander A. Stepanov, Anil R. Gangolli, Daniel E....
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 years 9 months ago
Small-Bias Spaces for Group Products
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
Raghu Meka, David Zuckerman
ICASSP
2010
IEEE
15 years 2 months ago
Hierarchical dictionary learning for invariant classification
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
Leah Bar, Guillermo Sapiro