71 search results - page 2 / 15 » On the Complexity of Reliable Root Approximation |
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
Application scenarios for mobile ad-hoc networks (MANETs) impose a variety of non-standard security requirements. furthermore, in many scenarios owner and user of devices do not a...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...
IJSYSC
2010
13 years 6 months ago
2010
— First order linear time invariant and time delayed dynamics of neutral type is taken into account with three rationally independent delays. There are two main contributions of ...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...