38 search results - page 3 / 8 » Computational Complexity of Generators and Nongenerators in ... |
CP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
CISST
2003
13 years 7 months ago
2003
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
BIRTHDAY
2007
Springer
14 years 5 days ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
JSC
2011
12 years 8 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...