✦ LIBER ✦

A lower bound for structuring element decompositions

✍ Scribed by Richardson, C.H.; Schafer, R.W.

Book ID: 117873686
Publisher: IEEE
Year: 1991
Tongue: English
Weight: 397 KB
Volume: 13
Category: Article
ISSN: 0162-8828
DOI: 10.1109/34.88571

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the integer element di

A lower bound for the integer element distinctness problem

✍ Anna Lubiw; András Rácz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Upper and lower bounds for matrix elemen

Upper and lower bounds for matrix elements

✍ R.H. Tipping 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Lower bounds for three-dimensional nonov

Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms

✍ Susanne C. Brenner; Qingmi He 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 559 KB

Lower bounds for approximate polygon dec

Lower bounds for approximate polygon decomposition and minimum gap

✍ Joachim Gudmundsson; Thore Husfeldt; Christos Levcopoulos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 67 KB

We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, into rectangles, and show an (n log n) lower bound on the timecomplexity. The result holds for any decomposition, optimal or

Lower bounds for the quadratic assignmen

Lower bounds for the quadratic assignment problem via triangle decompositions

✍ Stefan E. Karisch; Franz Rendl 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 686 KB

A Lower Bound for the Diagonal Elements

A Lower Bound for the Diagonal Elements of a Non-Negative Matrix

✍ Perfect, H. 📂 Article 📅 1956 🏛 Oxford University Press 🌐 English ⚖ 75 KB