Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...