Sciweavers

1245 search results - page 7 / 249
» Binary Sparse Coding
Sort
View
CORR
2007
Springer
75views Education» more  CORR 2007»
13 years 9 months ago
On Undetected Error Probability of Binary Matrix Ensembles
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
Tadashi Wadayama
ACCV
2006
Springer
13 years 11 months ago
Learning Multi-category Classification in Bayesian Framework
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
Atul Kanaujia, Dimitris N. Metaxas
CODCRY
2009
Springer
174views Cryptology» more  CODCRY 2009»
14 years 4 months ago
Equal-Weight Fingerprinting Codes
We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new e...
Ilya Dumer
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
Abstract The optimal one-error-correcting codes of length 13 that are doubly shortened perfect codes are classified utilizing the results of [
Patric R. J. Östergård, Olli Pottonen
ECCV
2010
Springer
14 years 2 months ago
Kernel Sparse Representation for Image Classification and Face Recognition
Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear sim...