2477 search results - page 76 / 496 » Approximate extended formulations |
160
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
188
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
143
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
130
click to vote
DMIN
2006
15 years 5 months ago
2006
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
137
click to vote
CSDA
2010
15 years 4 months ago
2010
In this paper, we consider a default strategy for fully Bayesian model determination for GLMMs. We address the two key issues of default prior specification and computation. In pa...