Sciweavers

127 search results - page 7 / 26
» Structural Properties of Stochastic Dynamic Programs
Sort
View
ORL
2000
77views more  ORL 2000»
13 years 9 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
ECCV
1992
Springer
14 years 11 months ago
Combining Intensity and Motion for Incremental Segmentation and Tracking Over Long Image Sequences
This paper presents a method for incrementally segmenting images over time using both intensity and motion information. This is done by formulating a model of physically signi cant...
Michael J. Black
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 10 months ago
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding
Given a probability distribution over a set of n words to be transmitted, the Huffman Coding problem is to find a minimal-cost prefix free code for transmitting those words. The b...
Mordecai Golin, Xiaoming Xu, Jiajin Yu
TPHOL
2008
IEEE
14 years 4 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
ISMB
1996
13 years 11 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...