2621 search results - page 73 / 525 » Near orders and codes |
139
click to vote
DCC
1999
IEEE
15 years 8 months ago
1999
IEEE
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a loss...
118
click to vote
DCC
2001
IEEE
16 years 4 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
131
click to vote
UCS
2004
Springer
15 years 9 months ago
2004
Springer
Fiducial tags can be recognised successfully and decoded by computer vision systems in order to produce location information. We term a system dependable if its observable results ...
151
click to vote
ESANN
2008
15 years 5 months ago
2008
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in orde...