361 search results - page 16 / 73 » Approximate counting by dynamic programming |
TCS
2008
13 years 7 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
IJCNN
2008
IEEE
14 years 1 months ago
2008
IEEE
— Much recent research activity has focused on the theory and application of quantum calculus. This branch of mathematics continues to find new and useful applications and there ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper addresses the problem of generating optimal joint trajectories for redundant manipulators when multiple criteria are to be considered. A dynamic programming approach...
ICAI
2007
13 years 9 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...