Sciweavers

124 search results - page 11 / 25
» Calculating cyclotomic polynomials
Sort
View
FPLE
1995
13 years 11 months ago
Explaining Algebraic Theory with Functional Programs
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
Jeroen Fokker
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 2 months ago
Approximation Algorithms for Scheduling Parallel Jobs
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Klaus Jansen, Ralf Thöle
WSCG
2004
157views more  WSCG 2004»
13 years 9 months ago
Efficient Implementation of Higher Order Image Interpolation
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
Roland Perko, Horst Bischof
INFORMATICALT
2008
97views more  INFORMATICALT 2008»
13 years 7 months ago
On the Use of the Formant Features in the Dynamic Time Warping Based Recognition of Isolated Words
Abstract. A possibility to use the formant features (FF) in the user-dependent isolated word recognition has been investigated. The word recognition was performed using a dynamic t...
Antanas Lipeika, Joana Lipeikiene
PODS
2007
ACM
131views Database» more  PODS 2007»
14 years 7 months ago
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
Todd J. Green, Gregory Karvounarakis, Val Tannen