Sciweavers

1192 search results - page 99 / 239
» Computing Weakest Readings
Sort
View
SIROCCO
2008
15 years 5 months ago
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Er...
FTCS
1997
115views more  FTCS 1997»
15 years 5 months ago
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum con gurations. In addition to processor and link failur...
Nancy A. Lynch, Alexander A. Shvartsman
BMCBI
2010
118views more  BMCBI 2010»
15 years 4 months ago
Bacillus anthracis genome organization in light of whole transcriptome sequencing
Emerging knowledge of whole prokaryotic transcriptomes could validate a number of theoretical concepts introduced in the early days of genomics. What are the rules connecting gene...
Jeffrey Martin, Wenhan Zhu, Karla D. Passalacqua, ...
PVLDB
2008
110views more  PVLDB 2008»
15 years 3 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
EJWCN
2010
118views more  EJWCN 2010»
14 years 11 months ago
Controlled Delegation Protocol in Mobile RFID Networks
To achieve off-line delegation for mobile readers, we propose a delegation protocol for mobile RFID allowing its readers access to specific tags through back-end server. That is t...
Ming-Hour Yang