2292 search results - page 213 / 459 » Hierarchical approximation and localization |
155
click to vote
COCOON
2007
Springer
16 years 23 days ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
113
click to vote
INFOCOM
2005
IEEE
16 years 5 days ago
2005
IEEE
— In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: Firstly, a throughput model based on...
198
click to vote
UAI
2008
15 years 8 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
180
click to vote
JAIR
2011
14 years 9 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
174
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...