5329 search results - page 43 / 1066 » The Weighted Majority Algorithm |
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
115
click to vote
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we present a family of algorithms for estimating stream weights for dynamic Bayesian networks with multiple observation streams. For the 2 stream case, we present a ...
IPL
2006
14 years 11 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
132
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potent...
104
click to vote
OPODIS
2007
15 years 1 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...