We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
Eduard Serradell, Przemyslaw Glowacki, Jan Kybic, ...
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...