Sciweavers

3373 search results - page 69 / 675
» Linear transformations on codes
Sort
View
CORR
2007
Springer
60views Education» more  CORR 2007»
14 years 9 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
VLDB
2007
ACM
117views Database» more  VLDB 2007»
15 years 10 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku
IPL
2007
104views more  IPL 2007»
14 years 9 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
CASES
2000
ACM
15 years 2 months ago
A code generation framework for Java component-based designs
In this paper, we describe a software architecture supporting code generation from within Ptolemy II. Ptolemy II is a componentbased design tool intended for embedded and real-tim...
Jeff Tsay, Christopher Hylands, Edward Lee
ICMCS
2006
IEEE
82views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Low-Complexity Adaptive Block-Size Transform Based on Extended Transforms
In this paper, a low-complexity 8x8/4x4 Adaptive Blocksize Transform (ABT) scheme is tentatively proposed for the Chinese Audio and Video coding Standard (AVS)1 . In the proposed ...
Honggang Qi, Wen Gao, Siwei Ma, Debin Zhao, Xiangy...