13603 search results - page 396 / 2721 » On the Computational Complexity of Cut-Reduction |
215
click to vote
ICIP
2008
IEEE
16 years 9 months ago
2008
IEEE
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...
188
click to vote
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
234
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
217
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
165
click to vote
ICALP
2004
Springer
16 years 1 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...