In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
Justine Lebrun, Sylvie Philipp-Foliguet, Philippe ...
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...