Name
Abstract | ||
|---|---|---|
The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, we obtain a tight asymptotic bound on the minimum size of its covering by the balls of radius ε. This bound holds for all but the most oblong ellipsoids. The results can be applied to vector quantization when different data streams are bundled together in one block. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ISIT.2004.1365560 | international symposium on information theory |
Keywords | Field | DocType |
entropy,vector quantisation,euclidean space,arbitrary dimension,asymptotic bound,data stream,thin ellipsoid covering,vector quantization | Discrete mathematics,Data stream mining,Combinatorics,Ellipsoid,Ball (bearing),Direction vector,Vector quantisation,Vector quantization,Euclidean geometry,Mathematics | Conference |
ISBN | Citations | PageRank |
0-7803-8280-3 | 0 | 0.34 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dumer, I. | 1 | 0 | 0.34 |
| Mark S. Pinsker | 2 | 35 | 13.59 |
| Vyacheslav V. Prelov | 3 | 145 | 29.59 |