98 search results - page 7 / 20 » Efficient solution of systems of Boolean equations |
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
86
Voted
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
FROCOS
2009
Springer
15 years 1 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
60
Voted
AMC
2005
14 years 9 months ago
2005
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equatio...
120
click to vote
ECCV
1998
Springer
15 years 11 months ago
1998
Springer
Registering 3D point sets is a common problem in computer vision. The case of two point sets has been analytically well solved by several authors. In this paper we present an analy...