5387 search results - page 378 / 1078 » Generating generic functions |
157
click to vote
CTRSA
2003
Springer
15 years 12 months ago
2003
Springer
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
182
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
169
click to vote
ICAI
2004
15 years 8 months ago
2004
Even though the Genetic Programming (GP) mechanism is capable of evolving any computable function, the means through which it does so is inherently flawed: the user must provide th...
197
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
152
click to vote
CGF
2004
15 years 6 months ago
2004
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...