3373 search results - page 156 / 675 » Linear transformations on codes |
111
Voted
EUROPAR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...
117
click to vote
DCC
2010
IEEE
15 years 3 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
134
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper introduces a simple and efficient representation for natural images. We partition an image into blocks and treat the blocks as vectors in a high-dimensional space. We t...
126
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
101
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...