Sciweavers

828 search results - page 33 / 166
» Bounded Hairpin Completion
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
Yuriy Tarannikov, Peter Korolev, Anton Botev
TCOM
2008
106views more  TCOM 2008»
13 years 7 months ago
Performance analysis on LDPC-Coded systems over quasi-static (MIMO) fading channels
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
Jingqiao Zhang, Heung-No Lee
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
AGENTS
2001
Springer
14 years 3 days ago
Scheduling multi-task multi-agent systems
We present a centralized and a distributed algorithms for scheduling multi-task agents in heterogeneous networks. Our centralized algorithm has an upper bound on the overall compl...
Rong Xie, Daniela Rus, Clifford Stein
AAAI
2006
13 years 9 months ago
A Characterization of Interventional Distributions in Semi-Markovian Causal Models
We offer a complete characterization of the set of distributions that could be induced by local interventions on variables governed by a causal Bayesian network of unknown structu...
Jin Tian, Changsung Kang, Judea Pearl