1149 search results - page 69 / 230 » Minimally non-Pfaffian graphs |
ESA
2008
Springer
15 years 1 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
VLSID
1996
IEEE
15 years 4 months ago
1996
IEEE
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
ICCD
2004
IEEE
15 years 8 months ago
2004
IEEE
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
116
click to vote
XSYM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
IPMI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...