✦ LIBER ✦

A logic minimization algorithm of functions with large DC-set

✍ Scribed by N.Q. Thang

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 586 KB
Volume: 11
Category: Article
ISSN: 0167-9260
DOI: 10.1016/0167-9260(91)90052-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A clustering algorithm for data-sets wit

A clustering algorithm for data-sets with a large number of classes

✍ Qiwen Zhang; Qen Ring Wang; Roger Boyle 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 682 KB

A three–step algorithm for CANDECOMP/PAR

A three–step algorithm for CANDECOMP/PARAFAC analysis of large data sets with multicollinearity

✍ Henk A. L. Kiers 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 2 views

Fitting the CANDECOMP/PARAFAC model by the standard alternating least squares algorithm often requires very many iterations. One case in point is that of analysing data with mild to severe multicollinearity. If, in addition, the size of the data is large, the computation of one CANDECOMP/PARAFAC sol

Local calibrations for minimizers of the

Local calibrations for minimizers of the Mumford–Shah functional with a regular discontinuity set

✍ Maria Giovanna Mora; Massimiliano Morini 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Using a calibration method, we prove that, if w is a function which satisfies all Euler conditions for the Mumford-Shah functional on a two-dimensional open set , and the discontinuity set S w of w is a regular curve connecting two boundary points, then there exists a uniform neighbourhood U of S w

A modification of minimum norm quadratic

A modification of minimum norm quadratic estimation of a generalized covariance function for use with large data sets

✍ Michael L. Stein 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 452 KB