12052 search results - page 303 / 2411 » computer 2010 |
179
click to vote
WAIFI
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
135
click to vote
IANDC
2010
15 years 4 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
164
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
147
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...