✦ LIBER ✦

Fast algorithms for lpdeconvolution

✍ Scribed by Yarlagadda, R.; Bednar, J.; Watt, T.

Book ID: 117906171
Publisher: IEEE
Year: 1985
Weight: 922 KB
Volume: 33
Category: Article
ISSN: 0096-3518
DOI: 10.1109/tassp.1985.1164508

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the connection between IRLS and Gauss

On the connection between IRLS and Gauss' method for l1inversion: Comments on "Fast algorithms for lpdeconvolution"

✍ Scales, J.; Treitel, S. 📂 Article 📅 1987 🏛 IEEE ⚖ 225 KB

Unscrambling for fast DFT algorithms

✍ Burrus, C.S. 📂 Article 📅 1988 🏛 IEEE ⚖ 242 KB

Fast parallel algorithms for forecasting

✍ P.K. Jana; B.P. Sinha 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 540 KB

This paper presents two parallel algorithms for forecasting implemented on a linear array and a tree model [1]. Both the algorithms are based on the weighted moving average technique [2,3]. Given that m and n are the numbers of the input observed data values and the numbers of weights, respectively,

Fast Algorithms for Area Morphology

✍ Scott T. Acton 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Efficient algorithms are developed for area morphology. As opposed to traditional morphological operations that alter grayscale images via a concatenation of order statistic filters, the area morphological operators manipulate connected components within the image level sets. Essentially, the area m

Fast algorithms for Brownian matrices

✍ Picinbono, B. 📂 Article 📅 1983 🏛 IEEE ⚖ 318 KB

Fast updating algorithms for TCAM

✍ Shah, D.; Gupta, P. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 333 KB