✦ LIBER ✦

Widening the dynamic range of pictures using a minimum spanning tree algorithm

✍ Scribed by Orly Yadid-Pecht

Book ID: 105839032
Publisher: Springer-Verlag
Year: 2000
Tongue: English
Weight: 106 KB
Volume: 12
Category: Article
ISSN: 0932-8092
DOI: 10.1007/s001380050118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal representation of the minimum sp

Optimal representation of the minimum spanning tree algorithm in associative parallel processors

✍ A. Sh. Nepomnyashchaya 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 613 KB

Efficient algorithms for finding the mos

Efficient algorithms for finding the most vital edge of a minimum spanning tree

✍ Kazuo Iwano; Naoki Katoh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 196 KB

A learning algorithm for the classificat

A learning algorithm for the classification of dynamic events using a neuron-like dynamic tree

✍ Richard R. Gawronski; Rita V. Rodriguez 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 1009 KB

The use of neuron-like networks (NN) for pattern recognition has a well-established history and numerous current applications. Most such applications are to static patterns while the theory developed for temporally changing visual patterns usually assumes rigid objects with well-defined boundaries.

Use of dynamic trees in a network simple

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

✍ Andrew V. Goldberg; Michael D. Grigoriadis; Robert E. Tarjan 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 735 KB