Graph theoretic models for multicast communications
β Scribed by Les Berry
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 436 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0169-7552
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the problem of identifying the dimension in which a sample of data points lives, when only their interpoint distances are known. We study as a random variable the average ''reach'' of vertices in the k-nearest-neighbors graph associated to the interpoint distance matrix, and we show how
## Abstract Secure multicasting allows the sender to deliver an identical secret to an arbitrary set of recipients through an insecure broadcasting channel, whereas the unintended recipients cannot obtain the secret. A practical approach for securing multicast communications is to apply a session k