✦ LIBER ✦

A fast and simple randomized parallel algorithm for maximal matching

✍ Scribed by Amos Israeli; A. Itai

Book ID: 113162969
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 330 KB
Volume: 22
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90144-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for maximal ƒ-matchings

✍ Oscar Garrido; Stefan Jarominek; Andrzej Lingas; Wojciech Rytter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A fast and simple randomized parallel al

A fast and simple randomized parallel algorithm for the maximal independent set problem

✍ Noga Alon; László Babai; Alon Itai 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 920 KB

A fast and efficient NC algorithm for ma

A fast and efficient NC algorithm for maximal matching

✍ Zhi-Zhong Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 415 KB

A randomized parallel algorithm for stri

A randomized parallel algorithm for string matching on hypercube

✍ Kuo-Liang Chung 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A simple randomized parallel algorithm f

A simple randomized parallel algorithm for list-ranking

✍ Richard J. Anderson; Gary L. Miller 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 506 KB

A fast BNM (Best Neighborhood Matching):

A fast BNM (Best Neighborhood Matching): Algorithm and parallel processing for image restoration

✍ Wen Li; David Zhang; Zhiyong Liu; Xiangzhen Qiao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

## Abstract Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computation‐intensive, which restricts their real applications on large‐scale image or video sequence rest