28 search results - page 2 / 6 » Some Recent Results on Local Testing of Sparse Linear Codes |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
BMVC
2010
13 years 2 months ago
2010
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
A key problem in using the output of an auditory model as the input to a machine-learning system in a machine-hearing application is to find a good feature-extraction layer. For ...
ESSMAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
RSA
2006
13 years 4 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...