4007 search results - page 188 / 802 » Computation with imprecise probabilities |
187
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—In this paper, we introduce an objective model of trust in peer-to-peer networks. Based on this model, we develop protocols that can be used by the peers in a peer-to-peer netwo...
214
click to vote
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
210
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
196
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
168
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
We consider nondeterministic and probabilistic termination problems in a process algebra that is equivalent to basic chemistry. We show that the existence of a terminating computat...