On Lattice Dicing
β Scribed by R.M. Erdahl; S.S. Ryshkov
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 824 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
A lattice dicing is an arrangement of hyperplanes with sufficient regularity so that the vertices of the resulting partition form a lattice. In this paper we introduce the notion of lattice dicing and point out how lattice dicings relate to geometry of numbers. We give a complete description of the possible lattice dicings of (\mathbb{R}^{n}) and (n \leqslant 5).
π SIMILAR VOLUMES
Since it is sometimes difficult to apply the technique of static program dicing in debugging programs, we introduce dynamic dicing as the dynamic counterpart of static dicing. As the effectiveness of program dicing techniques depends on the size of the program dices used, this paper uses a probabili
Venetia Fox is London's most sought-after actress, darling of the demimonde and every nobleman's desire. But she's about to face her toughest role yet--seducing a confession from the devilishly handsome and very dangerous Lord Linwood to bring her father's murderer to justice. She might have th