1410 search results - page 128 / 282 » Proving theorems by reuse |
146
click to vote
SSS
2009
Springer
16 years 15 days ago
2009
Springer
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
122
click to vote
FOCS
2008
IEEE
16 years 12 days 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(...
173
click to vote
ICASSP
2008
IEEE
16 years 12 days 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...
147
click to vote
ESOP
2007
Springer
16 years 4 days 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...
130
click to vote
ISAAC
2007
Springer
16 years 3 days 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...