227 search results - page 37 / 46 » Complexity Results for Compressing Optimal Paths |
112
click to vote
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
87
Voted
EOR
2008
14 years 11 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
106
click to vote
MM
2010
ACM
14 years 11 months ago
2010
ACM
Reliable delivery of 3D video contents to a wide set of users is expected to be the next big revolution in multimedia applications provided that it is possible to grant a certain ...
ISQED
2007
IEEE
15 years 5 months ago
2007
IEEE
In high-level synthesis for FPGA designs, scheduling and chaining of operations for optimal performance remain challenging problems. In this paper, we present a balanced schedulin...
ESTIMEDIA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract— This paper presents an exploration framework which performs data assignment and access scheduling exploration for applications given a multilayer memory architecture. O...