165 search results - page 14 / 33 » Fast Fibonacci Encoding Algorithm |
121
click to vote
CALC
2001
Springer
15 years 8 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...
264
click to vote
STOC
2003
ACM
16 years 3 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...
118
click to vote
ICMCS
2008
IEEE
15 years 10 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...
122
Voted
ICASSP
2008
IEEE
15 years 10 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...
133
Voted
ICC
2009
IEEE
15 years 10 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...