557 search results - page 21 / 112 » A Type-Coercion Problem in Computer Algebra |
ICCV
2001
IEEE
14 years 8 months ago
2001
IEEE
We present a linear approach to the 3D reconstruction problem from occluding contours using algebraic surfaces. The problem of noise and missing data in the occluding contours extr...
SIAMSC
2011
13 years 2 months ago
2011
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
SYNASC
2008
IEEE
14 years 2 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
IMAMS
2007
13 years 9 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...