1331 search results - page 74 / 267 » Complexity bounds for zero-test algorithms |
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
TCOM
2008
13 years 7 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
CPM
1999
Springer
14 years 2 days ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...