1986 search results - page 221 / 398 » Path Separability of Graphs |
117
Voted
DAC
2001
ACM
16 years 3 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
121
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
111
click to vote
AMAI
2000
Springer
15 years 7 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
120
Voted
ESOP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
129
Voted
FUN
2007
Springer
15 years 6 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...