564 search results - page 34 / 113 » Approximation algorithms for restricted Bayesian network str... |
156
click to vote
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
133
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
EACL
2009
ACL Anthology
16 years 1 months ago
2009
ACL Anthology
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
COMGEO
2010
ACM
15 years 20 days ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
97
Voted
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...