Sciweavers

804 search results - page 19 / 161
» On the Termination of the Chase Algorithm
Sort
View
POPL
2005
ACM
15 years 10 months ago
Transition predicate abstraction and fair termination
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...
Andreas Podelski, Andrey Rybalchenko
70
Voted
GMP
2006
IEEE
15 years 4 months ago
Subdivision Termination Criteria in Subdivision Multivariate Solvers
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] ...
Iddo Hanniel, Gershon Elber
IACR
2011
155views more  IACR 2011»
13 years 9 months ago
Terminating BKZ
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...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
15 years 2 months ago
An Improved Approximation Algorithm for Multiway Cut
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...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
74
Voted
EOR
2008
136views more  EOR 2008»
14 years 10 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
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...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...