Sciweavers

522 search results - page 19 / 105
» The 3-Steiner Root Problem
Sort
View
SCL
2008
87views more  SCL 2008»
13 years 8 months ago
Stabilizability of two-dimensional linear systems via switched output feedback
The problem of stabilizing a second-order SISO LTI system of the form x = Ax + Bu, y = Cx with feedback of the form u(x) = v(x)Cx is considered, where v(x) is real-valued and has ...
Keith R. Santarelli, Alexandre Megretski, Munther ...
NA
2010
118views more  NA 2010»
13 years 7 months ago
Practical Quasi-Newton algorithms for singular nonlinear systems
Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative met...
Sandra Buhmiler, Natasa Krejic, Zorana Luzanin
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 8 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
ICALP
2009
Springer
14 years 3 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
14 years 3 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber