✦ LIBER ✦

Fast computation in adaptive tree approximation

✍ Scribed by Peter Binev; Ronald DeVore

Book ID: 105878680
Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 225 KB
Volume: 97
Category: Article
ISSN: 0029-599X
DOI: 10.1007/s00211-003-0493-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast computation of adaptive wavelet exp

Fast computation of adaptive wavelet expansions

✍ A. Barinka; W. Dahmen; R. Schneider 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 573 KB

Fast PageRank approximation by adaptive

Fast PageRank approximation by adaptive sampling

✍ Liu, Wenting; Li, Guangxia; Cheng, James 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 399 KB

Fast computation of approximate entropy

✍ George Manis 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Adaptive binary tree for fast SVM multic

Adaptive binary tree for fast SVM multiclass classification

✍ Jin Chen; Cheng Wang; Runsheng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Fast monostatic radar cross section comp

Fast monostatic radar cross section computation using Maehly approximation

✍ Ling, J.; Gong, S.-X.; Wang, W.-T.; Wang, X.; Zhang, Y.-J. 📂 Article 📅 2011 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 211 KB

Fast high-dimensional approximation with

Fast high-dimensional approximation with sparse occupancy trees

✍ Peter Binev; Wolfgang Dahmen; Philipp Lamby 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 285 KB

This paper is concerned with scattered data approximation in high dimensions: Given a data set X ⊂ R d of N data points x i along with values y i ∈ R d ′ , i = 1, . . . , N, and viewing the y i as values y i = f (x i ) of some unknown function f , we wish to return for any query point x ∈ R d an app