1302 search results - page 146 / 261 » Free-Style Theorem Proving |
102
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
150
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
The empirical mode decomposition (EMD) has seen widespread use for analysis of nonlinear and nonstationary time-series. Despite some practical success, it lacks a firm theoretica...
127
click to vote
ESOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper contributes a technique that expands the set of object invariants that one can reason about in modular verification. The technique uses history invariants, tw...
112
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
108
click to vote
KI
2007
Springer
15 years 10 months ago
2007
Springer
With this talk we want to pay tribute to the late Professor Gerd Veenker who deserves the historic credit of initiating the formation of the German AI community. We present a summa...