Sciweavers

289 search results - page 23 / 58
» Program transformation by templates based on term rewriting
Sort
View
NIPS
2008
13 years 8 months ago
Recursive Segmentation and Recognition Templates for 2D Parsing
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...
Leo Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan ...
PAMI
2012
11 years 9 months ago
Recursive Segmentation and Recognition Templates for Image Parsing
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
Long Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan...
JAR
2010
95views more  JAR 2010»
13 years 2 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
LOPSTR
1997
Springer
13 years 11 months ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
POPL
1995
ACM
13 years 11 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip