✦ LIBER ✦

An efficient algorithm for fast O(N∗ln(N)) box counting

✍ Scribed by Xin-Jun Hou; Robert Gilmore; Gabriel B. Mindlin; Hernán G. Solari

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(N) algorithm for polygonal approxim

✍ L.P Cordella; G Dettori 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An O(n log n) algorithm for the convex b

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

An O(n2) Algorithm for Undirected Split

✍ T.H. Ma; J. Spinrad 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 654 KB

An O(n log n) algorithm for finding all

✍ Michael G Main; Richard J Lorentz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 602 KB

An O(n log m) algorithm for the Josephus

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB

An O(N2) algorithm for coloring perfect

✍ Alan Tucker; Donna Wilson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 501 KB