1204 search results - page 103 / 241 » Termination of Polynomial Programs |
119
Voted
FSTTCS
2009
Springer
15 years 5 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
117
Voted
SIAMDM
2010
14 years 7 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
117
click to vote
MP
2007
15 years 6 days ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
109
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...