165 search results - page 14 / 33 » Fast Fibonacci Encoding Algorithm |
CALC
2001
Springer
13 years 12 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
ICMCS
2008
IEEE
14 years 1 months ago
2008
IEEE
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
The discrete cosine transform (DCT) is widely used in image/video coding standards. However, since most DCT coefficients will be quantized to zeros, a large number of redundant co...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...