1552 search results - page 112 / 311 » On the Complexity of Constant Propagation |
161
click to vote
STACS
2007
Springer
16 years 15 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
135
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider rate allocation for multiple video users sharing a constant bitrate channel. Previously, overall quality of multiple users was improved by exploiting relative complexi...
169
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
163
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
146
click to vote
IWPSE
2003
IEEE
15 years 11 months ago
2003
IEEE
It is remarkable to think that even without any interest in finding suitable methods and concepts that would allow complex software systems to evolve and remain manageable, the e...