22 search results - page 1 / 5 » On optimizing over lift-and-project closures |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
MP
2008
13 years 5 months ago
2008
ESWS
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
CDC
2010
IEEE
13 years 6 days ago
2010
IEEE
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...