804 search results - page 19 / 161 » On the Termination of the Chase Algorithm |
229
click to vote
POPL
2005
ACM
16 years 2 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
107
click to vote
GMP
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] ...
127
click to vote
IACR
2011
14 years 1 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
114
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
112
click to vote
EOR
2008
15 years 2 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...