Sciweavers

736 search results - page 55 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
DCC
2003
IEEE
14 years 7 months ago
An Error-Resilient Blocksorting Compression Algorithm
A Burrows-Wheeler Compressor breaks input into blocks, quickly makes each more compressible, and compresses the modified block with a simple arithmetic or Huffman compressor. We p...
Lee Butterman, Nasir D. Memon
FOCS
2000
IEEE
14 years 1 days ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 2 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
CODES
2003
IEEE
14 years 28 days ago
Design space exploration of a hardware-software co-designed GF(2m) galois field processor for forward error correction and crypt
This paper describes a hardware-software co-design approach for flexible programmable Galois Field Processing for applications which require operations over GF(2m ), such as RS an...
Wei Ming Lim, Mohammed Benaissa
FPL
2008
Springer
207views Hardware» more  FPL 2008»
13 years 9 months ago
Bitstream compression techniques for Virtex 4 FPGAs
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
Radu Stefan, Sorin Dan Cotofana