Let G=(V, E) be an undirected graph and C a subset of vertices. If the sets B r (v) 5 C, v Β₯ V, are all nonempty and different, where B r (v) denotes the set of all points within distance r from v, we call C an r-identifying code. We give bounds on the best possible density of r-identifying codes in
Identifying the Existence of Bar Codes in Compressed Images
β Scribed by C.Y. Maa
- Publisher
- Elsevier Science
- Year
- 1994
- Weight
- 405 KB
- Volume
- 56
- Category
- Article
- ISSN
- 1049-9652
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract There are essentially two approaches in the ZivβLempel code to be used in the data compression. They have already been proposed also as the improvements of the ZivβLempel code, which can be considered as combinations of the two methods. This paper shows that by executing the combination
This powerful new book teaches you how to use the universal language of visual imagery to deeply communicate with audiences worldwide. Whatever your genre or style, you can empower your media product by using this accessible collection of visual images in a way that will help you express your messag
## Abstract The soβcalled βKety modelβ is a twoβcompartment pharmacokinetic model describing tumor perfusion kinetics. Its parameters, the transendothelial transfer constant (__K__^__trans__^), extravascular extracellular volume fraction (Ο ~__e__~), and microvascular plasma volume fraction (Ο ~__p__
## Abstract Surface model of semicircular ducts and utricle. See Figure 3, Column B Row E (bottom right panel) in Jang et al., on page 562, in this issue.