473 search results - page 66 / 95 » Heapable Sequences and Subsequences |
154
click to vote
FORTE
2004
15 years 7 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
163
click to vote
IJFCS
2006
15 years 6 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
152
click to vote
COSIT
1997
Springer
15 years 10 months ago
1997
Springer
As described here, pragmatic navigation attempts to harness simple facts about a two-dimensional environment to facilitate travel through it without an explicit map. It relies upo...
168
click to vote
MPC
1992
Springer
15 years 10 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...
157
click to vote
DM
2006
15 years 6 months ago
2006
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n-1 -2 n-1 2 . Construction of Boolean function...