Sciweavers

5793 search results - page 319 / 1159
» Individual communication complexity
Sort
View
TPDS
2008
76views more  TPDS 2008»
15 years 6 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
TIT
2010
124views Education» more  TIT 2010»
15 years 1 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
IPL
2006
141views more  IPL 2006»
15 years 6 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
ECCC
2007
86views more  ECCC 2007»
15 years 6 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
NAR
2011
241views Computer Vision» more  NAR 2011»
15 years 1 months ago
PRIDB: a protein-RNA interface database
The Protein–RNA Interface Database (PRIDB) is a comprehensive database of protein–RNA interfaces extracted from complexes in the Protein Data Bank (PDB). It is designed to fac...
Benjamin A. Lewis, Rasna R. Walia, Michael Terribi...