✦ LIBER ✦

Local operations on labelled dot patterns

✍ Scribed by Azriel Rosenfeld; Jean-Michel Jolion

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 450 KB
Volume: 9
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(89)90001-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On visual orientation of dot patterns

✍ P. Lánský; N. Yakimoff; T. Radil 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 553 KB

Linear-time connected-component labeling

Linear-time connected-component labeling based on sequential local operations

✍ Kenji Suzuki; Isao Horiba; Noboru Sugie 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Spatially Localized Formation of InAs Qu

Spatially Localized Formation of InAs Quantum Dots on Shallow Patterns Regardless of Crystallographic Directions

✍ J. H. Lee; Z. M. Wang; W. T. Black; V. P. Kunets; Y. I. Mazur; G. J. Salamo 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 999 KB

## Abstract We report on the ability to grow InAs quantum dots into patterns of any shape. We specifically demonstrate the spatial localization of InAs quantum dots on mesa and trench patterns varying from line, square and triangle patterns on GaAs (100) substrates by molecular beam epitaxy. Based

On the visual orientation of random dot

On the visual orientation of random dot Moiré patterns

✍ Petr Lánsky; J. Mates; T. Radil 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 516 KB

One-to-one quantum dot-labeled single lo

One-to-one quantum dot-labeled single long DNA probes

✍ Shibin He; Bi-Hai Huang; Junjun Tan; Qing-Ying Luo; Yi Lin; Jun Li; Yong Hu; Lu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Quantum dots (QDs) have been received most attention due to their unique properties. Constructing QDs conjugated with certain number of biomolecules is considered as one of the most important research goals in nanobiotechnology. In this study, we report polymerase chain reaction (PCR) amplification

Searching with Local Constraints on Erro

Searching with Local Constraints on Error Patterns

✍ Jurek Czyzowicz; K.B. Lakshmanan; Andrzej Pelc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 175 KB

We give an asymptotically optimal algorithm of search for an unknown element in a finite set under the assumption that at most one error can occur in every sequence of \(r\) consecutive answers, where \(r \geqslant 3\) is a constant.