614 search results - page 55 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
AMDO
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...
TCS
2008
13 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
HAPTICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Volume haptics has shown itself an effective way of enhancing precision and speed in interaction with medical or scientific visualization. This paper presents a mixed solver appr...
UAI
2004
13 years 9 months ago
2004
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...