𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An n log n algorithm for determining the congruity of polyhedra

✍ Scribed by Kōkichi Sugihara

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
866 KB
Volume
29
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An n log n Algorithm for Onlin
An n log n Algorithm for Online BDD Refinement
✍ Nils Klarlund 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Binary decision diagrams are in widespread use in verification systems for the canonical representation of finite functions. Here we consider multivalued BDDs, which represent functions of the form : ‫ނ‬ ª L L , where L L is a finite set of leaves. We study a rather natural online BDD refinement pro

An O(nlog log n) Learning Algorithm for
An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution
✍ Y. Mansour 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 571 KB

We show that a DNF with terms of size at most \(d\) can be approximated by a function at most \(d^{O(d \log 1 / \epsilon)}\) nonzero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at most \(\epsilon\). This property is used to derive a learnin

AnO(log*n) Approximation Algorithm for t
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
✍ Rina Panigrahy; Sundar Vishwanathan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The input to the asymmetric p-center problem consists of an integer p and an n = n distance matrix D defined on a vertex set V of size n, where d gives the i j distance from i to j. The distances are assumed to obey the triangle inequality. For a subset S : V the radius of S is the minimum distance