✦ LIBER ✦

Efficient algorithms for learning functions with bounded variation

✍ Scribed by Philip M. Long

Book ID: 114273426
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 223 KB
Volume: 188
Category: Article
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00164-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Concentration factors for functions with

Concentration factors for functions with harmonic bounded mean variation

✍ L. Hu; X. L. Shi 📂 Article 📅 2007 🏛 Akadmiai Kiad 🌐 English ⚖ 493 KB

Lagrange interpolation for functions of

Lagrange interpolation for functions of bounded variation

✍ J. Prestin 📂 Article 📅 1993 🏛 Akadmiai Kiad 🌐 English ⚖ 454 KB

Hardware efficient algorithms for trigon

Hardware efficient algorithms for trigonometric functions

✍ Fowkes, R.E. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 445 KB

Rate of approximation for functions with

Rate of approximation for functions with derivatives of bounded variation

✍ Guo-Deng Bai; Ya-Hui Hua; Sen-Yen Shaw 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 238 KB

I/O-Efficient Algorithms for Graphs of B

I/O-Efficient Algorithms for Graphs of Bounded Treewidth

✍ Anil Maheshwari; Norbert Zeh 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 976 KB

Efficient Parallel Algorithms for Graphs

Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

✍ Jens Lagergren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ž 3 . Ž. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ž 2 . position algorithm is O O n log n . The tree-decomposi