✦ LIBER ✦

Closure of two computational algorithms based on the idea of orthogonalization

✍ Scribed by A.F. Shapkin

Publisher: Elsevier Science
Year: 1967
Weight: 397 KB
Volume: 7
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(67)90016-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the algebraic closure of two

✍ H.W Lenstra Jr. 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 390 KB

Optimal algorithms to compute the closur

Optimal algorithms to compute the closure of a set of iso-rectangles

✍ Eljas Soisalon-Soininen; Derick Wood 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 852 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On limits on the computational power of

On limits on the computational power of data-accumulating algorithms

✍ Stefan D Bruda; Selim G Akl 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In the data-accumulating paradigm, inputs arrive continuously in real time, and the computation terminates when all the already received data are processed before another datum arrives. Previous research states that a constant upper bound on the running time of a successful algorithm within this par

An algorithm for computing the transitiv

An algorithm for computing the transitive closure of a fuzzy similarity matrix

✍ Fu Guoyao 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Analysis of Two Gradient-Based Algorithm

Analysis of Two Gradient-Based Algorithms for On-Line Regression

✍ Nicolò Cesa-Bianchi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

In this paper we present a new analysis of two algorithms, Gradient Descent and Exponentiated Gradient, for solving regression problems in the on-line framework. Both these algorithms compute a prediction that depends linearly on the current instance, and then update the coefficients of this linear