We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
In state-of-the-art image retrieval systems, an image is
represented by a bag of visual words obtained by quantizing
high-dimensional local image descriptors, and scalable
schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...
Semantic similarity measures play important roles in information retrieval and Natural Language Processing. Previous work in semantic web-related applications such as community mi...