1383 search results - page 160 / 277 » On the Complexity of the Interlace Polynomial |
175
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Algebraic invariants extracted from coefficients of implicit polynomials (IPs) have been attractive because of its convenience for solving the recognition problem in computer visio...
183
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
155
click to vote
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
181
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
173
click to vote
AIPS
2008
15 years 8 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...