Results 251 to 260 of about 15,432 (298)
Some of the next articles are maybe not open access.
Simultaneous Embedding of Embedded Planar Graphs
International Journal of Computational Geometry & Applications, 2011A simultaneous embedding with fixed edges (SEFE) of a set of k planar graphs G1,…,Gk on the same set of vertices is a set of k planar drawings of G1,…,Gk, respectively, such that each vertex is placed on the same point in all the drawings and each edge is represented by the same Jordan curve in the drawings of all the graphs it belongs to.
Patrizio Angelini +2 more
openaire +3 more sources
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017
Network embedding is increasingly employed to assist network analysis as it is effective to learn latent features that encode linkage information. Various network embedding methods have been proposed, but they are only designed for a single network scenario.
Linchuan Xu +3 more
openaire +1 more source
Network embedding is increasingly employed to assist network analysis as it is effective to learn latent features that encode linkage information. Various network embedding methods have been proposed, but they are only designed for a single network scenario.
Linchuan Xu +3 more
openaire +1 more source
Graphs and Combinatorics, 2001
Let \(S\) be a quasiordered set (quoset) or topological space and \(\text{Sub} S\) be the set of all nonempty subquosets or subspaces quasiordered by embeddability, respectively. For a cardinal number \(n\), \(p_n\) and \(q_n\) denote the smallest size of spaces \(S\) such that each poset respectively quoset with \(n\) points is embeddable in \(\text ...
Marcel Erné, Jürgen Reinhold
openaire +3 more sources
Let \(S\) be a quasiordered set (quoset) or topological space and \(\text{Sub} S\) be the set of all nonempty subquosets or subspaces quasiordered by embeddability, respectively. For a cardinal number \(n\), \(p_n\) and \(q_n\) denote the smallest size of spaces \(S\) such that each poset respectively quoset with \(n\) points is embeddable in \(\text ...
Marcel Erné, Jürgen Reinhold
openaire +3 more sources
Embedding security in wireless embedded systems
16th International Conference on VLSI Design, 2003. Proceedings., 2003We present an overview of how the need for security will impact the design of embedded systems and the ICs they contain. After a brief introduction to security, we discuss the challenges security processing poses to embedded system architects, integrators, HW designers, and SW engineers.
Srivaths Ravi 0001 +2 more
openaire +1 more source
2001
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attracted less attention, is to close open systems. Standard model checkers cannot handle open systems directly and closing is commonly done by adding an environment process, which ...
Natalia Sidorova, Martin Steffen
openaire +2 more sources
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attracted less attention, is to close open systems. Standard model checkers cannot handle open systems directly and closing is commonly done by adding an environment process, which ...
Natalia Sidorova, Martin Steffen
openaire +2 more sources
Evolutionary Computation, 2002
In this paper we introduce embedded landscapes as an extension of NK landscapes and MAXSAT problems. This extension is valid for problems where the representation can be expressed as a simple sum of subfunctions over subsets of the representation domain.
openaire +3 more sources
In this paper we introduce embedded landscapes as an extension of NK landscapes and MAXSAT problems. This extension is valid for problems where the representation can be expressed as a simple sum of subfunctions over subsets of the representation domain.
openaire +3 more sources
Journal of Symbolic Logic, 1969
Since Cohen [1] showed the independence of the axiom of choice from the other axioms of ZF, a number of people have used his forcing technique to show how badly choice can fail while certain vestiges of it remain. Many of these arguments involve the introduction of a generic sequence or generic set of generic sets of ordinals into a countable standard ...
openaire +1 more source
Since Cohen [1] showed the independence of the axiom of choice from the other axioms of ZF, a number of people have used his forcing technique to show how badly choice can fail while certain vestiges of it remain. Many of these arguments involve the introduction of a generic sequence or generic set of generic sets of ordinals into a countable standard ...
openaire +1 more source
From Embedded Test to Embedded Diagnosis
European Test Symposium (ETS'05), 2005Testing integrated circuits with millions of transistors puts strong requirements on test volume, test application time, test speed, and test resolution. To overcome these challenges, it is widely accepted to partition test resources between the automatic test equipment (ATE) and the circuit under test (CUT). These strategies may reach from simple test
openaire +1 more source