419 search results - page 8 / 84 » First Order Paths in Ordered Trees |
ICDAR
2005
IEEE
14 years 2 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
TCOM
2010
13 years 3 months ago
2010
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
AAAI
1996
13 years 10 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
LCN
1999
IEEE
14 years 25 days ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...