?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
The problem of building a regression tree is considered when the response variable is a probability density function. Splitting criteria which are well adapted to measure the diss...
This paper isconcerned with learning the canonical gray scalestructure of the images of a classof objects. Structure is defined in terms of the geometry and layout of salientimage...
Online Social Networks (OSNs) are more and more popular recently; people may through them interact with each other for the purpose of social intercourse. The client/server OSN arch...
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...