✦ LIBER ✦

An algorithm for polygonal approximation based on iterative point elimination

✍ Scribed by Arie Pikaz; Its'hak Dinstein

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 626 KB
Volume: 16
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(95)80001-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an iterative projection algorithm for

On an iterative projection algorithm for solving ill posed problems with an approximately specified operator

✍ V.P. Tanana 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 596 KB

An algorithm for frequency relaying base

An algorithm for frequency relaying based on least absolute value approximations

✍ S.A. Soliman; G.S. Christensen; D.H. Kelly; N. Liu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 855 KB

An algorithm for nonlinear L1 curve-fitt

An algorithm for nonlinear L1 curve-fitting based on the smooth approximation

✍ Ziqiang Yang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 272 KB

An algorithm for the construction of bes

An algorithm for the construction of best approximations based on Kolmogorov's criterion

✍ Gerhard Opfer 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 868 KB

An efficient DCOC algorithm based on hig

An efficient DCOC algorithm based on high-quality approximations for problems including eigenvalue constraints

✍ M. Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 780 KB

An iterated local search algorithm for l

An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests

✍ Luis M. De Campos; Juan M. Fernández-Luna; J. Miguel Puerta 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search