Abstract: This paper deals with a sub graph matching problem in Region Adjacency Graph (RAG) applied to symbol spotting in graphical documents. RAG is a very important, efficient and natural way of ...

Abstract: We have 1600 of BLE beacon emitters installed on and around classrooms to estimate location of students for automated roll call. The BLE beacon emitters do not have any information about ...

In the first line: a number of next lines. In a line (expect the first): a number of vertices and after space an adjacency matrix written from the left to the right and from the top to the bottom.

In this work, we explore heuristics for the Adjacency Graph Packing problem, which can be applied to the Double Cut and Join (DCJ) Distance Problem. The DCJ is a rearrangement operation and the ...

Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...