559 search results - page 93 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
DATE
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper presents a new compaction algorithm to improve the yield of IC layout. The yield is improved by reducing the area where the faults are more likely to happen known as cr...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
ISBI
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper presents a new framework for multiple object segmentation in medical images that respects the topological properties and anatomical relationships of structures as given...
JAIR
2011
13 years 3 months ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
JMMA
2002
13 years 8 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...