The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of comparing two directed graphs with nodes that have been subdivided into classes of different type. The matching process is based on a constrained projection of the nodes of the graphs in a lower dimensional space. This procedure is formulated as a non-convex optimization problem. The objective function uses the two adjacency matrices of the graphs where the nodes are adequately...
In this paper, we consider the problem of maximizing the coupling between the isometric projections of two square matrices of dimensions m and n. This coupling is defined as an inner product between the matrices. This is a non-convex optimization problem with isometry constraints on the variables. The optimization set is an equinormed set and we develop a gradient-type algorithm to solve the problem...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.