2570 search results - page 235 / 514 » Fast Algorithms For The Computation Of Ranklets |
156
click to vote
HIPEAC
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
117
click to vote
RT
2005
Springer
15 years 9 months ago
2005
Springer
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
146
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
122
click to vote
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
128
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...