Sciweavers

229 search results - page 15 / 46
» Agreements Without Disagreements
Sort
View
ICDCN
2011
Springer
13 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 7 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
NAACL
2010
13 years 7 months ago
Cheap, Fast and Good Enough: Automatic Speech Recognition with Non-Expert Transcription
Deploying an automatic speech recognition system with reasonable performance requires expensive and time-consuming in-domain transcription. Previous work demonstrated that non-pro...
Scott Novotney, Chris Callison-Burch
BMCBI
2007
115views more  BMCBI 2007»
13 years 9 months ago
Comparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...
Gilles Didier, Laurent Debomy, Maude Pupin, Ming Z...
BMCBI
2008
144views more  BMCBI 2008»
13 years 9 months ago
Local conservation scores without a priori assumptions on neutral substitution rates
Background: Comparative genomics aims to detect signals of evolutionary conservation as an indicator of functional constraint. Surprisingly, results of the ENCODE project revealed...
Janis Dingel, Pavol Hanus, Niccolò Leonardi...