1552 search results - page 195 / 311 » On the Complexity of Constant Propagation |
183
click to vote
TWC
2008
15 years 6 months ago
2008
Abstract-- Existing space-time codes have focused on multipleantenna systems with linear modulation schemes such as phaseshift keying and quadrature amplitude modulation. Continuou...
162
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
215
click to vote
ML
2000
ACM
15 years 6 months ago
2000
ACM
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
173
click to vote
TCS
2011
15 years 1 months ago
2011
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
189
click to vote
SIAMSC
2010
15 years 1 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...