Generating subroutine codes with MACSYMA
β Scribed by Megan Florence; Stanly Steinberg; Patrick Roache
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 357 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let Ο be a partition of the positive integer n. A partition of the set X n = {1, 2, . . . , n} is said to be of type Ο if the sizes of its classes form the partition Ο of n. Given 1 < r < n, an r element subset A of X n and a partition Ο of X n are said to be orthogonal if every class of Ο meets A i
The Partition Type Conjecture, a generalization of the Middle Levels Conjecture of combinatorics, states that for all positive integers n and r, with n > r > 1, and every non-exceptional partition type Ο of weight r of X n , there exists a constant weight Gray code which admits an orthogonal labelin
Words of low weight in trace codes correspond to curves with many points and the same holds for subcodes of low weight via the fibre product construction. In 1996 Heijnen and Pellikaan gave an algorithm to determine a basis of minimum weight subcodes of generalized Reed Muller codes. We show how thi
Due to the limitations of current computer graphics technology mimicing realistic facial textures, such as wrinkles, is very difficult. Facial texture updating and compression are crucial to achieving realistic facial animation for low bit rate modelbased coding. In this paper, we present a partial