This work is motivated by the observation that in DES-like ciphexs it is possible to choose the round functions in such a way that every non-trivial one-round characteristic has sm...
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
— An intercarrier interference (ICI) canceling technique for multiple-input single-output (MISO) orthogonal frequency division multiplexing (OFDM) systems in fast fading channels...
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...