807 search results - page 9 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
IPL
2000
14 years 11 months ago
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
CGF
2004
14 years 11 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Line localization from a single image of a central camera is an ill-posed problem unless other constraints or apriori knowledge are exploited. Recently, it has been proved that no...
EUROGP
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
104
click to vote
ESOP
2009
Springer
15 years 3 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...