1447 search results - page 222 / 290 » Graphs and Path Equilibria |
145
click to vote
GREC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for symbol recognition using structural signatures and a Galois Lattice as classifier. The structural signatures are based on top...
160
click to vote
CAV
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
106
click to vote
DELTA
2004
IEEE
15 years 8 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
130
click to vote
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
171
click to vote
ICCI
1991
15 years 8 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...