Sciweavers

728 search results - page 6 / 146
» Compressing combinatorial objects
Sort
View
DCG
2002
81views more  DCG 2002»
13 years 6 months ago
Separoids, Their Categories and a Hadwiger-Type Theorem for Transversals
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....
FOCM
2010
140views more  FOCM 2010»
13 years 5 months ago
Combinatorial Sublinear-Time Fourier Algorithms
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...
Mark A. Iwen
TCS
2010
13 years 5 months ago
A combinatorial approach to the analysis of bucket recursive trees
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...
Markus Kuba, Alois Panholzer
CASES
2006
ACM
14 years 20 days ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
ICPR
2000
IEEE
14 years 7 months ago
Motion Segmentation Using Feature Selection and Subspace Method Based on Shape Space
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
Naoyuki Ichimura