15073 search results - page 248 / 3015 » Probabilistic algorithms for computing resultants |
208
click to vote
CALCO
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
150
click to vote
IACR
2011
14 years 4 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
157
click to vote
CAV
2006
Springer
15 years 8 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
115
click to vote
IMA
1995
Springer
15 years 8 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
152
click to vote
BIOINFORMATICS
2006
15 years 4 months ago
2006
Motivation Quantitative estimation of the regulatory relationship between transcription factors and genes is a fundamental stepping stone when trying to develop models of cellular...