Sciweavers

ISPD
2000
ACM
108views Hardware» more  ISPD 2000»
13 years 9 months ago
A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...
Yu-Yen Mo, Chris C. N. Chu
ICALP
2010
Springer
13 years 9 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
ISIPTA
2003
IEEE
117views Mathematics» more  ISIPTA 2003»
13 years 10 months ago
Dynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Gert de Cooman, Matthias C. M. Troffaes
IPPS
2003
IEEE
13 years 10 months ago
Sequence Alignment on the Cray MTA-2
The standard algorithm for alignment of DNA sequences using dynamic programming has been implemented on the Cray MTA-2 (Multithreaded Architecture-2) at ENRI (Electronic Navigatio...
Shahid H. Bokhari, Jon R. Sauer
ICIP
2003
IEEE
13 years 10 months ago
Stochastic rate-control of interframe video coders for VBR channels
We propose a new algorithm for the real-time control of an interframe video coder operating with a variable rate channel such as wireless channels or the Internet. Using technique...
Julián Cabrera, José Ignacio Ronda, ...
CLUSTER
2003
IEEE
13 years 10 months ago
Parallel Design Pattern for Computational Biology and Scientific Computing Applications
Dynamic programming is an important algorithm design technique in computational biology and scientific computing. Typical applications using this technique are very compute-intens...
Weiguo Liu, Bertil Schmidt
SWAT
2004
Springer
78views Algorithms» more  SWAT 2004»
13 years 10 months ago
Online Maintenance of k-Medians and k-Covers on a Line
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
ICIAR
2004
Springer
13 years 10 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
13 years 10 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
13 years 10 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny