✦ LIBER ✦

Construction of an efficient algorithm over a set of linear convolution algorithms

✍ Scribed by V. V. Myasnikov

Book ID: 110209551
Publisher: SP MAIK Nauka/Interperiodica
Year: 2008
Tongue: English
Weight: 119 KB
Volume: 18
Category: Article
ISSN: 1054-6618
DOI: 10.1134/s1054661808040214

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficiency of the reduced wise algorithm

Efficiency of the reduced wise algorithm over a set of convolution algorithms

✍ A. Yu. Bavrina; V. V. Myasnikov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 210 KB

An efficient algorithm for a large Toepl

An efficient algorithm for a large Toeplitz set of linear equations

✍ Jain, J. 📂 Article 📅 1979 🏛 IEEE ⚖ 369 KB

Efficiency of a Good But Not Linear Set

Efficiency of a Good But Not Linear Set Union Algorithm

✍ Tarjan, Robert Endre 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 649 KB

A Bilinear Algorithm for Optimizing a Li

A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem

✍ Jesús M. Jorge 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 145 KB

A method for constructing a recognition

A method for constructing a recognition algorithm in algebra over an estimate calculation set

✍ M. Yu. Romanov 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 154 KB

An incremental algorithm to construct a

An incremental algorithm to construct a lattice of set intersections

✍ Derrick G. Kourie; Sergei Obiedkov; Bruce W. Watson; Dean van der Merwe 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 864 KB

a b s t r a c t An incremental algorithm to construct a lattice from a collection of sets is derived, refined, analyzed, and related to a similar previously published algorithm for constructing concept lattices. The lattice constructed by the algorithm is the one obtained by closing the collection o