Sciweavers

2766 search results - page 155 / 554
» Algorithms for trigonometric polynomials
Sort
View
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
15 years 6 months ago
Lower Bounds and Separations for Constant Depth Multilinear Circuits
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
Ran Raz, Amir Yehudayoff
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 5 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
AUTOMATICA
2007
108views more  AUTOMATICA 2007»
15 years 4 months ago
A minimum-time control strategy for torque tracking in permanent magnet AC motor drives
: A minimum-time torque control strategy for permanent-magnet ac motor drives is presented. The proposed solution is obtained by an ad-hoc procedure based on the computation of rea...
Franco Blanchini, Stefano Miani, Matteo Tomasini, ...
CAGD
2006
90views more  CAGD 2006»
15 years 4 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
CPC
2007
61views more  CPC 2007»
15 years 4 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus