✦ LIBER ✦

A new algorithm for tile generation

✍ Scribed by Youn-Long Lin; Yu-Chin Hsu

Book ID: 107920187
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 734 KB
Volume: 9
Category: Article
ISSN: 0167-9260
DOI: 10.1016/0167-9260(90)90019-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Genetic Algorithm for Loop Tiling

✍ Saeed Parsa; Shahriar Lotfi 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 1012 KB

A new algorithm for generation of permut

A new algorithm for generation of permutations

✍ Shmuel Zaks 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 381 KB

A new algorithm for generating derangeme

A new algorithm for generating derangements

✍ Selim G. Akl 📂 Article 📅 1980 🏛 Springer Netherlands 🌐 English ⚖ 271 KB

A new algorithm for generating hilbert c

A new algorithm for generating hilbert curves

✍ A. J. Fisher 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

New algorithm for generation of spanning

New algorithm for generation of spanning trees

✍ B. V. Cherkasskii 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 741 KB

A Fast Algorithm for Adapted Time–Freque

A Fast Algorithm for Adapted Time–Frequency Tilings

✍ Christoph M. Thiele; Lars F. Villemoes 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We first consider orthonormal bases of R N consisting of discretized rescaled Walsh functions, where N is a power of two. Given a vector, the best basis with respect to an additive cost function is found with an algorithm of order O(N log N). The algorithm operates in the time-frequency plane by con