141 search results - page 26 / 29 » Approximate algorithms for credal networks with binary varia... |
COMPGEOM
2001
ACM
13 years 9 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
DATAMINE
2006
13 years 5 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
AAAI
2010
13 years 7 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
ICDCS
2006
IEEE
13 years 12 months ago
2006
IEEE
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...