2766 search results - page 393 / 554 » Algorithms for trigonometric polynomials |
131
click to vote
IEEECGIV
2009
IEEE
15 years 11 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
112
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
148
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
130
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
119
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...