2766 search results - page 378 / 554 » Algorithms for trigonometric polynomials |
181
click to vote
IBERAMIA
2010
Springer
15 years 2 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
161
click to vote
EMNLP
2009
15 years 2 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
160
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
150
click to vote
CASC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
161
click to vote
COMMA
2010
14 years 11 months ago
2010
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...