3758 search results - page 47 / 752 » A Complete Subsumption Algorithm |
IJCGA
2006
13 years 7 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we propose a novel algorithm for completing rotationally symmetrical shapes under severe occlusions. The intuitive idea is to use the existing contour, under a care...
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...