16430 search results - page 413 / 3286 » On Computable Tree Functions |
214
click to vote
RTA
2005
Springer
16 years 9 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
192
click to vote
CGI
2003
IEEE
16 years 4 days ago
2003
IEEE
We present a novel approach to design artistic and believable trees in a cartoon-like style, which can be rendered by an animated camera to produce a convincing 3D-like experience...
179
click to vote
ICPPW
2003
IEEE
16 years 3 days ago
2003
IEEE
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
162
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
179
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes a new method for generating surfaces of branching tubular structures with given centerlines and radii. As the centerlines are not straight lines, the cross-se...