𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the decomposition of binary shapes into meaningful parts

✍ Scribed by Andreas Held; Keiichi Abe


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
825 KB
Volume
27
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the decomposition of a graph into sta
✍ Michael Tarsi πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 248 KB

It is known that whenever u(u -1) -0 (mod 2m) and u ~=2tn, the complete graph K, can be decomposed into edge disjoint, m-stars [l, 21. In this paper we prove that K, can be

Multidimensional Upwinding. Part II. Dec
✍ Michael Fey πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 357 KB

Based on a genuine multidimensional numerical scheme, called the Method of Transport, we derive a form of the compressible Euler equations, capable of a linearization for any space dimension. This form enables a rigorous error analysis of the linearization error without the knowledge of the numerica

On the decomposition of n-cubes into iso
✍ John Frederick Fink πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 324 KB

## Abstract We prove that if T is any tree having __n__ edges (__n__ β‰₯ 1), then the __n__‐cube Q~n~ can be decomposed into 2^n‐1^ edge‐disjoint induced subgraphs, each of which is isomorphic to T. We use this statement to obtain two results concerning decompositions of Q~n~ into subgraphs isomorphi