16 search results - page 2 / 4 » The Complexity of Maximum Matroid-Greedoid Intersection |
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
TWC
2008
13 years 5 months ago
2008
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...
CCCG
2007
13 years 6 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...