270 search results - page 13 / 54 » Constraint relaxation in approximate linear programs |
101
Voted
DCC
2003
IEEE
16 years 1 days ago
2003
IEEE
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
121
Voted
ESWS
2011
Springer
14 years 4 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
109
Voted
MP
2006
15 years 12 days ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
115
Voted
WADS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
115
Voted
SIAMJO
2011
14 years 6 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...