1245 search results - page 19 / 249 » Binary Sparse Coding |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
CGO
2003
IEEE
14 years 2 months ago
2003
IEEE
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
SIGMOD
2005
ACM
14 years 3 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
ICIP
1997
IEEE
14 years 11 months ago
1997
IEEE
Here we describe a baseline-based binary shape coding method in which arbitrarily shaped object is represented by the traced 1-D data from baseline and turning point (TP). The sha...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
Sparse coding networks, which utilize unsupervised learning to maximize coding efficiency, have successfully reproduced response properties found in primary visual cortex [1]. Ho...