The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...
We propose an original automatic alignment of definitions taken from different dictionaries that could be associated to the same concept although they may have different labels. Th...
Laura Diosan, Alexandrina Rogozan, Jean-Pierre P&e...
In this paper, we argue that the agglomerative clustering with vector cosine similarity measure performs poorly due to two reasons. First, the nearest neighbors of a document belo...
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
In this paper, we explore the use of a Gaussian posteriorgram based representation for unsupervised discovery of speech patterns. Compared with our previous work, the new approach...