27 search results - page 5 / 6 » The complexity of irredundant sets parameterized by size |
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
SIAMCOMP
2000
13 years 5 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
TCOM
2008
13 years 5 months ago
2008
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
SI3D
2005
ACM
13 years 11 months ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...