906 search results - page 64 / 182 » Matching Subsequences in Trees |
MPC
1992
Springer
14 years 1 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
GAMEON
2007
13 years 10 months ago
2007
This paper proposes an approach to automatically adapt game AI to the environment of the game (i.e., the socalled map). In the approach, a particular map is first analysed for sp...
NIPS
2001
13 years 10 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
EACL
1993
ACL Anthology
13 years 10 months ago
1993
ACL Anthology
This paper offers a provisional mathematical typology of metrical representations. First, a family of algebras corresponding to different versions of grid and bracketed grid theor...
VLSID
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper a new technique for partial product reduction based on the use of look-up tables for efficient processing is presented. We describe how to construct counter devices ...