Sciweavers

1806 search results - page 172 / 362
» Randomness and halting probabilities
Sort
View
ASIACRYPT
2006
Springer
14 years 1 months ago
New Approach for Selectively Convertible Undeniable Signature Schemes
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
Kaoru Kurosawa, Tsuyoshi Takagi
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
14 years 1 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
WSC
2007
14 years 16 days ago
Efficient suboptimal rare-event simulation
Much of the rare-event simulation literature is concerned with the development of asymptotically optimal algorithms. Because of the difficulties associated with applying these id...
Xiaowei Zhang, Jose Blanchet, Peter W. Glynn
NAACL
2007
13 years 11 months ago
Joint Versus Independent Phonological Feature Models within CRF Phone Recognition
We compare the effect of joint modeling of phonological features to independent feature detectors in a Conditional Random Fields framework. Joint modeling of features is achieved ...
Ilana Bromberg, Jeremy Morris, Eric Fosler-Lussier
WSC
1997
13 years 11 months ago
On the Efficiency of the Splitting and Roulette Approach for Sensitivity Analysis
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
Viatcheslav B. Melas