281 search results - page 26 / 57 » Primitive words and roots of words |
JSYML
2010
13 years 6 months ago
2010
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
SIBGRAPI
2006
IEEE
14 years 1 months ago
2006
IEEE
The estimation of multiple orientations in multidimensional signals is a strongly non-linear problem to which a two-step solution is here presented. First, the problem is lineariz...
ESOP
2003
Springer
14 years 25 days ago
2003
Springer
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...