Sciweavers

539 search results - page 5 / 108
» Linear complexity of transformed sequences
Sort
View
JMM2
2007
96views more  JMM2 2007»
14 years 9 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
ARITH
2005
IEEE
15 years 3 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
TOG
2002
116views more  TOG 2002»
14 years 9 months ago
Linear combination of transformations
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
Marc Alexa
ISCAS
2005
IEEE
117views Hardware» more  ISCAS 2005»
15 years 3 months ago
Linear transform based motion compensated prediction for luminance intensity changes
A linear transform based motion compensated prediction (LTMCP) scheme is proposed in this paper to improve the efficiency of inter-frame prediction when the intensity of luminance...
Debing Liu, Yuwen He, Shipeng Li, Qingming Huang, ...
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
14 years 11 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan