77 search results - page 2 / 16 » On the Sum of Square Roots of Polynomials and related proble... |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
TCS
2008
13 years 5 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
DAM
2008
13 years 5 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
CDC
2010
IEEE
13 years 8 days ago
2010
IEEE
This paper presents a sum of squares (SOS) approach to the stability analysis of networked control systems (NCSs) incorporating time-varying delays and time-varying transmission in...
IJSN
2006
13 years 5 months ago
2006
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...