227 search results - page 9 / 46 » Complexity Results for Compressing Optimal Paths |
DAC
2000
ACM
16 years 2 days ago
2000
ACM
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
106
click to vote
ISCAS
2011
IEEE
14 years 2 months ago
2011
IEEE
In order to enable real-time software-based video encoding, in this work we optimized the prediction stage of an H.264 video encoder, in the complexity sense. Thus, besides lookin...
CLUSTER
2004
IEEE
14 years 11 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
COCO
2004
Springer
15 years 4 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
TON
2002
14 years 10 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...