Given positive integers m, k, s with m > sk, let D m,k,s represent the set {1, 2, . . . , m}\{k, 2k, . . . , sk}. The distance graph G(Z , D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| β D m,k,s . This paper investigates chromatic numbers and circular chroma
Graph-based classification of multiple observation sets
β Scribed by E. Kokiopoulou; P. Frossard
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 763 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
There are many di!erent criteria for the comparative analysis of pattern classi"ers. They include generalization ability, computational complexity and understanding of the feature space. In some applications such as the medical diagnostic systems it is crucial to use reliable tools, whose behavior i
Since before the beginning of the Galileo spacecraft's Jupiter orbital tour, we have observed Io from the ground using NASA's Infrared Telescope Facility (IRTF). We obtained images of Io in reflected sunlight and in-eclipse at 2.3, 3.5, and 4.8 lm. In addition, we have measured the 3.5 lm brightness
This paper reassesses the usefulness of the morphological classification of carbonate platforms into rimmed shelves and ramps. Whilst the existing classifications have value in describing platform margin morphology at any one time, the terms rimmed-shelf and ramp are less successful at categorising