✦ LIBER ✦

Fast algorithms for the maximum convolution problem

✍ Scribed by Michael Bussieck; Hannes Hassler; Gerhard J. Woeginger; Uwe T. Zimmermann

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 487 KB
Volume: 15
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90048-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for Fast Convolutions on Moti

Algorithms for Fast Convolutions on Motion Groups

✍ Alexander B Kyatkin; Gregory S Chirikjian 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 238 KB

In this paper we apply techniques from noncommutative harmonic analysis to the development of fast algorithms for the computation of convolution integrals on motion groups. In particular, we focus on the group of rigid-body motions in 3-space, which is denoted here as SE(3). The general theory of ir

Decomposition algorithms for the maximum

Decomposition algorithms for the maximum-weight connected graph problem

✍ Heungsoon Felix Lee; Daniel R. Dooly 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

An exact algorithm for the maximum cliqu

An exact algorithm for the maximum clique problem

✍ Randy Carraghan; Panos M. Pardalos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Fast algorithms for long transportation

Fast algorithms for long transportation problems

✍ A. Brandt; J. Intrator 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

A faster algorithm for the maximum weigh

A faster algorithm for the maximum weighted tardiness problem

✍ Malcolm C. Fields; Greg N. Frederickson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB

The struction algorithm for the maximum

The struction algorithm for the maximum stable set problem revisited

✍ K.W. Hoke; M.F. Troyon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 491 KB