Searching for "Recursion flattening." – sorted by Relevance.
-
September 1 9 9 0
- .ext; it and all the files it references are recursively flattened. The result is a single, flat representation
- Add To MetaCart
-
Dynamic Refinement of Deformable Triangle Meshes for Rendering
- refine(s) else draw(r) Even if the tail-recursion is flattened by transformation into a loop, two cost
- Cited by 3 (1 self) – Add To MetaCart
-
A first-order representation for knowledge discovery and Bayesian classification on relational data
- , therefore the flattening process is inherently recursive. It consists of flattening the structure
- Cited by 2 (1 self) – Add To MetaCart
-
A first-order representation for knowledge discovery and Bayesian classification on relational data
- , therefore the flattening process is inherently recursive. It consists of flattening the structure
- Add To MetaCart
-
A First-Order Representation for Knowledge Discovery
- , therefore the flattening process is inherently recursive. It consists of flattening the structure
- Add To MetaCart
-
Encoding Types in ML-like Languages
- (superreverse T) to combine them. We cannot reverse a list recursively and then flatten the result, because
- Cited by 36 (0 self) – Add To MetaCart
-
Unifying Tables, Objects and Documents
- ]. For instance this happens if a nested stream like [[...[[[],0],1],...],n-1] gets recursively flattened
- Add To MetaCart
-
CoPa: a Parallel Programming Language for Collections
- , the elimination of recursion, and the flattening of nested parallelism. We are especially concerned
- Cited by 7 (1 self) – Add To MetaCart
-
Scheduling Issues in the Co-Synthesis of Reactive Real-Time Systems
- recursively. Flattening results in parallel loops that can be processed by the following techniques. 4
- Cited by 8 (2 self) – Add To MetaCart
-
Ordering type constraints: A structured approach
- This tree walk puts the recursively flattened constraint subtrees up front, while preserving the order
- Cited by 3 (3 self) – Add To MetaCart

