Sciweavers

110 search results - page 15 / 22
» Chinese Remaindering with Errors
Sort
View
CISS
2008
IEEE
15 years 8 months ago
The Chinese Generals Problem
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
Edwin Soedarmadji
111
Voted
COLING
2010
14 years 8 months ago
Word-based and Character-based Word Segmentation Models: Comparison and Combination
We present a theoretical and empirical comparative analysis of the two dominant categories of approaches in Chinese word segmentation: word-based models and character-based models...
Weiwei Sun
STACS
2010
Springer
15 years 8 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
129
Voted
CISS
2008
IEEE
15 years 8 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
CRYPTO
2003
Springer
137views Cryptology» more  CRYPTO 2003»
15 years 7 months ago
New Partial Key Exposure Attacks on RSA
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
Johannes Blömer, Alexander May