536 search results - page 69 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
STACS
2007
Springer
14 years 2 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
SAS
2005
Springer
14 years 2 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
FMCAD
2004
Springer
14 years 7 days ago
2004
Springer
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
TSP
2008
13 years 8 months ago
2008
Since the seminal work of Stein in the 1950s, there has been continuing research devoted to improving the total meansquared error (MSE) of the least-squares (LS) estimator in the l...
FOCS
1999
IEEE
14 years 24 days ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...