In this paper we study the topology of transversals to a family of convex sets as a subset of a Grassmanian manifold. This topology seems to be ruled by a combinatorial structure w...
Jorge L. Arocha, Javier Bracho, Luis Montejano, D....
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...