Sciweavers

2038 search results - page 9 / 408
» Improvements to the Psi-SSA representation
Sort
View
EUROCRYPT
2012
Springer
12 years 15 hour ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
IJON
2006
78views more  IJON 2006»
13 years 9 months ago
Improving self-organization of document collections by semantic mapping
In text management tasks, the dimensionality reduction becomes necessary to computation and interpretability of the results generated by machine learning algorithms. This paper de...
Renato Fernandes Corrêa, Teresa Bernarda Lud...
CORR
2010
Springer
275views Education» more  CORR 2010»
13 years 9 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
JASIS
2006
84views more  JASIS 2006»
13 years 9 months ago
A "stereo" document representation for textual information retrieval
Encouraged by a significant improvement over LSI (latent semantic indexing) approach in textual information retrieval of the DLSI (differential latent semantic indexing) approach ...
Liang Chen, Jia Zeng, Naoyuki Tokuda
TIT
2002
94views more  TIT 2002»
13 years 9 months ago
A generalized uncertainty principle and sparse representation in pairs of bases
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...
Michael Elad, Alfred M. Bruckstein