Kernel methods, like the well-known Support Vector Machine (SVM), have gained a growing interest during the last years for designing QSAR/QSPR models having a high predictive strength. One of the key concepts of SVMs is the usage of a so-called kernel function, which can be thought of as a special similarity measure. In this paper we consider kernels for molecular structures, which are based on...

In this work we propose a scheme for analysis of the shape of a 3D model. We use Extended Reeb Graph to describe the topological structure of the model which we further enrich with extracted geometrical features. The nodes of the graph represent different components of the model, and we propose to analyze their shape separately. Shape characteristics such as taper/enlargement, average curvature...

Agglomerative clustering, which iteratively merges small clusters, is commonly used for clustering because it is conceptually simple and produces a hierarchy of clusters. In this paper, we propose a novel graph-structural agglomerative clustering algorithm, where the graph encodes local structures of data. The idea is to define a structural descriptor of clusters on the graph and to assume that...

Abstract: The (max,+) algebra is usually used to model Timed event graph. In this paper, we show that P-time event graphs which extend Timed event graph, can be modelled using maximum, minimum and addition operations. The result is a new model called interval descriptor system where the time evolution is not strictly deterministic but belongs to intervals. The cycle-time vector allows us to to ...

We address the problem of large scale image retrieval in a wide-baseline setting, where for any query image all the matching database images will come from very different viewpoints. In such settings traditional bag-of-visual-words approaches are not equipped to handle the significant feature descriptor transformations that occur under large camera motions. In this paper we present a novel appr...

Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...

We propose a novel graph-theoretical dynamic user pairing strategy based on the rate requirements in cellular networks employing non-orthogonal multiple access (NOMA). The proposed approach relies first constructing conflict graph corresponding to all possible pairings and then reformulating problem of finding best pairs as that maximum weighted independent set (MWIS) graph. This formulation tu...