951 search results - page 15 / 191 » On the Computation of Correctly-Rounded Sums |
JUCS
2010
14 years 8 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
92
Voted
STACS
2005
Springer
15 years 3 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
TIT
2008
14 years 10 months ago
2008
Abstract--The sum capacity of the one-sided parallel Gaussian interference channel is shown to be a concave function of user powers. Exploiting the inherent structure of the proble...
CG
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multipleoutput (MIMO) system, wherein each user may receive more than one data stream. We ...