Irredundancy in multiple interval representations
β Scribed by Edward R. Scheinerman
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 496 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In a multiple interval intersection representation of a graph it is required that at least one interval from each of a pair of adjacent vertices intersect. It is permitted for there to be several such intersections, even though these additional intersections are 'superflons' or 'redundant'.
By disallowing such redundancies one arrives at the concept of an irredundant multiple interval representation. We show that these irredundant representations can be much more inefficient than representations which allow redundancies. Finally, we show that even when some redundancy is permitted, the inefficiency remains.
π SIMILAR VOLUMES
## Abstract This paper discusses two alternative innovation representations (forward and backward) of a state space model of a multivariate weakly stationary time series, and suggests estimators of system matrices and innovation noise covariances which are alternative to these based on stochastic r
Vector quantization schemes are widely used for waveform coding of one-and multidimensional signals. In this contribution, a novel energybased, split vector quantization technique is presented, which represents digital signals efficiently as measured by the number of bits per sample for a predetermi