515 search results - page 49 / 103 » A Dynamic Programming Approach to Optimal Integrated Code Ge... |
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
BMCBI
2005
13 years 10 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
CVPR
2003
IEEE
14 years 4 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
ICS
1994
Tsinghua U.
14 years 2 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
TASE
2008
IEEE
13 years 10 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...