2911 search results - page 354 / 583 » A Logic of Graph Constraints |
120
click to vote
ICCD
2000
IEEE
16 years 3 months ago
2000
IEEE
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...
144
click to vote
DIAL
2006
IEEE
16 years 19 days ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
160
click to vote
CP
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
207
click to vote
MOZ
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
150
click to vote
PATMOS
2004
Springer
15 years 12 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...