43 search results - page 1 / 9 » Combinatorial complexity in O-minimal geometry |
DCG
2010
13 years 2 months ago
2010
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
COMPGEOM
1993
ACM
13 years 8 months ago
1993
ACM
STOC
2007
ACM
14 years 5 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...