827 search results - page 97 / 166 » The Complexity of Probabilistic Lobbying |
172
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
159
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
144
click to vote
IWINAC
2007
Springer
16 years 14 days ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
200
click to vote
SSPR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
168
click to vote
DIS
2009
Springer
15 years 10 months ago
2009
Springer
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...