Sciweavers

344 search results - page 6 / 69
» Some Theorems We Should Prove
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
Patrick Denantes, Florence Bénézit, ...
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
CIE
2010
Springer
14 years 4 days ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...
AML
2011
204views Mathematics» more  AML 2011»
13 years 2 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
ICASSP
2008
IEEE
14 years 1 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