Sciweavers

597 search results - page 74 / 120
» Combinatorial Models for Cooperation Networks
Sort
View
IJCAI
2007
13 years 10 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
Shin-ichi Minato, Ken Satoh, Taisuke Sato
NDSS
2003
IEEE
14 years 2 months ago
Proxy Cryptography Revisited
In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various proxy functions allow two cooperating parties F (the “FBI”) and P (the “pro...
Anca-Andreea Ivan, Yevgeniy Dodis
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
NN
2007
Springer
14 years 3 months ago
Impact of Higher-Order Correlations on Coincidence Distributions of Massively Parallel Data
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
Sonja Grün, Moshe Abeles, Markus Diesmann
SUTC
2010
IEEE
14 years 28 days ago
Data Caching in Ad Hoc Networks Using Game-Theoretic Analysis
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
Yutian Chen, Bin Tang