368 search results - page 5 / 74 » Sphere Methods for LP |
168
click to vote
NIPS
2008
15 years 7 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
148
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
202
click to vote
SMA
1995
ACM
15 years 10 months ago
1995
ACM
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...
124
click to vote
NIPS
2004
15 years 7 months ago
2004
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
179
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...