Sciweavers

Share
DLOG
2011
8 years 1 months ago
Status QIO: An Update
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
Birte Glimm, Yevgeny Kazakov, Carsten Lutz
DLOG
2011
8 years 1 months ago
The Complexity of Probabilistic EL
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
Jean Christoph Jung, Víctor Gutiérre...
CORR
2011
Springer
165views Education» more  CORR 2011»
8 years 2 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
TWC
2010
8 years 5 months ago
Linear precoding of STBC over correlated Ricean MIMO channels
A linear precoder is designed to minimize an upper bound of the pairwise error probability (PEP) when using arbitrary space-time block codes (STBC) over correlated Ricean fading c...
Manav R. Bhatnagar, Are Hjørungnes
TWC
2010
8 years 5 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
TIT
2010
150views Education» more  TIT 2010»
8 years 5 months ago
Information-theoretic key agreement of multiple terminals: part I
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...
Amin Aminzadeh Gohari, Venkat Anantharam
SIAMDM
2010
119views more  SIAMDM 2010»
8 years 5 months ago
A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
Randy Cogill, Cheng Peng
IJNSEC
2010
144views more  IJNSEC 2010»
8 years 5 months ago
A Note On Self-Shrinking Lagged Fibonacci Generator
Lagged Fibonacci Generators (LFG) are used as a building block of key-streamgenerator in stream cipher cryptography. In this note we have used the self-shrinkingconcept in LFG and ...
Moon K. Chetry, W. B. Vasantha Kandaswamy
CORR
2010
Springer
114views Education» more  CORR 2010»
8 years 5 months ago
Secure Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendo...
TIT
2011
149views more  TIT 2011»
8 years 5 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
books