Sciweavers

420 search results - page 72 / 84
» Volume in General Metric Spaces
Sort
View
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
14 years 10 days ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
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...
Korinna Bade, Andreas Nürnberger
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
14 years 10 days ago
A plant location guide for the unsure
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...
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 11 months ago
Multigroup-Decodable STBCs from Clifford Algebras
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 ...
Sanjay Karmakar, B. Sundar Rajan
CVPR
2011
IEEE
13 years 2 months ago
Entropy Rate Superpixel Segmentation
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....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
CVIU
2011
13 years 2 months ago
Graph attribute embedding via Riemannian submersion learning
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...