227 search results - page 30 / 46 » Complexity Results for Compressing Optimal Paths |
133
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
140
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
125
click to vote
EOR
2007
15 years 4 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
189
click to vote
HVEI
2010
15 years 2 months ago
2010
This paper presents a novel system that employs an adaptive neural network for the no-reference assessment of perceived quality of JPEG/JPEG2000 coded images. The adaptive neural ...
126
Voted
SIROCCO
2010
15 years 5 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...