Sciweavers

2008 search results - page 12 / 402
» Computing with Equations
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 months ago
The implicit equation of a canal surface
A canal surface is an envelope of a one parameter family of spheres. In this paper we present an efficient algorithm for computing the implicit equation of a canal surface generat...
Marc Dohm, Severinas Zube
ICLP
2001
Springer
14 years 5 days ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 6 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
DCC
2011
IEEE
13 years 2 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
COMPUTING
2000
63views more  COMPUTING 2000»
13 years 7 months ago
Cache-Aware Multigrid Methods for Solving Poisson's Equation in Two Dimensions
Markus Kowarschik, Ulrich Rüde, Christian Wei...