Sciweavers

1972 search results - page 272 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 9 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ICASSP
2010
IEEE
15 years 4 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
127
Voted
DCC
2003
IEEE
16 years 4 months ago
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin W...
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
15 years 10 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...