94 search results - page 5 / 19 » Proving and Constraint Solving in Computational Origami |
DAM
2000
13 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
AGP
2010
IEEE
14 years 19 days ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
ICCV
2009
IEEE
15 years 15 days ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...