✦ LIBER ✦

An O(N log N) Algorithm for Shape Modeling

✍ Scribed by R. Malladi and J. A. Sethian

Book ID: 123639989
Publisher: National Academy of Sciences
Year: 1996
Tongue: English
Weight: 790 KB
Volume: 93
Category: Article
ISSN: 0027-8424
DOI: 10.2307/39719

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log n log log n) parallel maximum

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An O(n log n) Manhattan path algorithm

✍ Witold Lipski Jr. 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 262 KB

An O(n log n) algorithm for finding diss

An O(n log n) algorithm for finding dissimilar strings

✍ Sarmad Abbasi; Anirvan Sengupta 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Let P be a finite alphabet and x E Z'. A string y E Zm is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an 0( n log n) algorithm which on input x E 2? and an integer m < n outputs an integer k and y E .Zm such that: (1) y is k-dissimi

An O(n log n + m log log n) maximum weig

An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs

✍ Wei-Kuan Shih; Wen-Lian Hsu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

An O(n log n) algorithm for a maxmin loc

An O(n log n) algorithm for a maxmin location problem

✍ C.Pandu Rangan; Ramesh Govindan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 257 KB

An O(n log n) algorithm for suboptimal r

An O(n log n) algorithm for suboptimal rectilinear Steiner trees

✍ Hwang, F. 📂 Article 📅 1979 🏛 IEEE ⚖ 324 KB