1243 search results - page 20 / 249 » Complexity reduction of C-Algorithm |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
DLT
2003
14 years 11 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
103
click to vote
FSTTCS
1991
Springer
15 years 1 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
132
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...
ICIP
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we present a spatial resolution reduction transcoding architecture for H.264/AVC, which extends open-loop transcoding with a low-complexity compensation technique i...