—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
Abstract. In this paper, we introduce the concept of planar generalized Stewart platform (GSP) consisting of two rigid bodies connected with three constraints between three pairs o...
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Ontology integration, alignment, and reuse are at the heart of Semantic Web vision. The alignment between two ontologies can be achieved easily provided both share the same axioma...
Abstract. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the beh...