Sciweavers

1322 search results - page 131 / 265
» Unsound Theorem Proving
Sort
View
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 4 months ago
Poly-logarithmic Independence Fools AC0 Circuits
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
Mark Braverman
SSS
2009
Springer
138views Control Systems» more  SSS 2009»
14 years 4 months ago
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
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...
Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer
FOCS
2008
IEEE
14 years 4 months ago
Nearly Tight Low Stretch Spanning Trees
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(...
Ittai Abraham, Yair Bartal, Ofer Neiman
ICASSP
2008
IEEE
14 years 4 months ago
Some properties of an empirical mode type signal decomposition algorithm
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...
Stephen D. Hawley, Les E. Atlas, Howard J. Chizeck
ESOP
2007
Springer
14 years 4 months ago
Using History Invariants to Verify Observers
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...
K. Rustan M. Leino, Wolfram Schulte