Sciweavers

719 search results - page 10 / 144
» Solving Sparse Linear Constraints
Sort
View
SAGA
2001
Springer
15 years 4 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
16 years 7 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
96
Voted
ISSRE
2007
IEEE
15 years 1 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
15 years 2 days ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo
AAAI
1996
15 years 1 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter