A. Marzal and E. Vidal: "A N Best Sentence Hypotheses Enumeration Algorithm with Duration Constraints based on the Two Level Algorithm". Proceedings of the 11th IAPR International Conference on Pattern Recognition. (1992) Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
An Algorithm for Efficient Computation of K Shortest Paths - Jimenez, Marzal (1994) (1 citation) Self-citation (Marzal) (Correct)
....Algorithm is also well suited for distributed computation of the K shortest paths in communication networks, since every node can keep and manage its own set of candidates to next shortest path. Finally, the algorithm is easily extensible to find the K shortest paths in multi graphs (in [MV92] it is shown applied to a Connected Word Recognition problem) and to find the K best solutions to general Dynamic Programming problems [Marz94] ....
A. Marzal and E. Vidal: "A N Best Sentence Hypotheses Enumeration Algorithm with Duration Constraints based on the Two Level Algorithm". Proceedings of the 11th IAPR International Conference on Pattern Recognition. (1992)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC