7129 search results - page 292 / 1426 » Approximation Algorithms for Treewidth |
173
click to vote
IPCO
1998
15 years 5 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
101
click to vote
JMLR
2011
14 years 11 months ago
2011
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
186
click to vote
ICDT
2011
ACM
14 years 8 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
213
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
126
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...