4007 search results - page 188 / 802 » Computation with imprecise probabilities |
137
Voted
ICCCN
2008
IEEE
15 years 10 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...
153
Voted
PDCAT
2007
Springer
15 years 10 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...
151
Voted
CORR
2010
Springer
15 years 4 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 ...
136
click to vote
CORR
1998
Springer
15 years 3 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...
112
Voted
CONCUR
2008
Springer
15 years 5 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...