Sciweavers

719 search results - page 7 / 144
» Solving Sparse Linear Constraints
Sort
View
PC
2002
118views Management» more  PC 2002»
13 years 10 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
JSAT
2007
47views more  JSAT 2007»
13 years 10 months ago
On Solving Boolean Combinations of UTVPI Constraints
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
Sanjit A. Seshia, K. Subramani, Randal E. Bryant
VMCAI
2007
Springer
14 years 5 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
CADE
2009
Springer
14 years 11 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
ICASSP
2010
IEEE
13 years 11 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal