Sciweavers

565 search results - page 26 / 113
» Geometry of Upper Probabilities
Sort
View
EUROCRYPT
1993
Springer
13 years 11 months ago
Differentially Uniform Mappings for Cryptography
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...
Kaisa Nyberg
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 5 months ago
Metric uniformization and spectral bounds for graphs
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...
GLOBECOM
2007
IEEE
14 years 1 months ago
ICI Canceling Space-Frequency Block Code for MISO-OFDM in Fast Fading Channels
— An intercarrier interference (ICI) canceling technique for multiple-input single-output (MISO) orthogonal frequency division multiplexing (OFDM) systems in fast fading channels...
Jae Yeun Yun, Eui-Rim Jeong, Jongguk Ahn, Jongtae ...
ICLP
2009
Springer
14 years 8 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
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...
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 2 months ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
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...
Sérgio Crisóstomo, Udo Schilcher, Ch...