𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The error-bounded descriptional complexity of approximation networks

✍ Scribed by Rüdiger W. Brause

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
944 KB
Volume
6
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Error-bounded biarc approximation of pla
Error-bounded biarc approximation of planar curves
✍ Hyungjun Park 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Presented in this paper is an error-bounded method for approximating a planar parametric curve with a G 1 arc spline made of biarcs. The approximated curve is not restricted in specially bounded shapes of confined degrees, and it does not have to be compatible with non-uniform rational B-splines (NU

Error bounded piecewise linear approxima
Error bounded piecewise linear approximation of freeform surfaces
✍ Gershon Elber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Two methods for piecewise linear approximation of freeform surfaces are presented. One scheme exploits an intermediate bilinear approximation and the other employs global curvature bounds. Both methods attempt to adaptively create piecewise linear approximations of the surfaces, employing the maximu

The complexity of approximating MAPs for
The complexity of approximating MAPs for belief networks with bounded probabilities
✍ Ashraf M. Abdelbar; Stephen T. Hedetniemi; Sandra M. Hedetniemi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Probabilistic inference and maximum a posteriori (MAP) explanation are two important and related problems on Bayesian belief networks. Both problems are known to be NP-hard for both approximation and exact solution. In 1997, Dagum and Luby showed that efficiently approximating probabilistic inferenc

An efficient, error-bounded approximatio
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
✍ Stephane Redon; Ming C. Lin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 622 KB

Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the problem as purely geometric in nature, though dynamics or quasi-statics of linkages should also be considered. Existing opti