537 search results - page 13 / 108 » A new upper bound for 3-SAT |
ESA
1998
Springer
14 years 20 days ago
1998
Springer
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
IWCMC
2006
ACM
14 years 2 months ago
2006
ACM
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...