✦ LIBER ✦

An efficient algorithm to generate maximum entropy distributions

✍ Scribed by P. C. Basu; A. B. Templeman

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 827 KB
Volume: 20
Category: Article
ISSN: 0029-5981
DOI: 10.1002/nme.1620200607

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new, storage-efficient algorithm for m

A new, storage-efficient algorithm for maximum-entropy spectrum reconstruction

✍ Alan S Stern; Jeffrey C Hoch 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 918 KB

An efficient distributed bridge-finding

An efficient distributed bridge-finding algorithm

✍ Pranay Chaudhuri 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 759 KB

An algorithm for deconvolution by the ma

An algorithm for deconvolution by the maximum entropy method with astronomical applications

✍ Johann Reiter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Use of the Maximum Entropy Formalism to

Use of the Maximum Entropy Formalism to Determine Drop Size Distribution Characteristics

✍ Christophe Dumouchel; Stéphane Boyaval 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB

Efficient algorithms for finding maximum

Efficient algorithms for finding maximum cliques of an overlap graph

✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

An Approximate Time Evolution Operator t

An Approximate Time Evolution Operator to Generate the Verlet Algorithm

✍ J.C. Greer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 111 KB