Gray Codes Faulting Matchings (2009)
Darko Dimitrov, Tomas Dvorak, Petr Gregor, Riste Skrekovski
A (cyclic) n-bit Gray code is a (cyclic) ordering of all 2^n binary strings of length n such that consecutive strings differ in a single bit. Equivalently, an n-bit Gray code can be viewed as a...
On the Bounding Boxes Obtained by Principal Component Analysis (2008)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in R d. In this paper we give bounds on the approximation factor of PCA bounding boxes of convex polygons...
On the Bounding Boxes Obtained by Principal Component Analysis Abstract (2008)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Principle component analysis (PCA) is a commonly used to compute a bounding box of a point set in R d. In this paper we give bounds on the approximation factor of PCA bounding boxes of convex...
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
×�ØÀ�Ö�Û�ÓÒØÖ��ÙØ�Ò�ÛÙÔÔ�Ö�ÓÙÒ�×ÓÒØ���ÔÔÖÓÜ �...
Upper and lower bounds on the quality of the PCA bounding boxes (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in R d. The popularity of this heuristic lies in its speed, easy implementation and in the fact that...