2766 search results - page 70 / 554 » Algorithms for trigonometric polynomials |
108
click to vote
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
15 years 4 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
116
Voted
TWC
2010
14 years 7 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
77
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
COLT
2008
Springer
15 years 2 months ago
2008
Springer
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
98
Voted
IJAC
2007
15 years 20 days ago
2007
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...