474 search results - page 31 / 95 » Approximation Algorithms for Tensor Clustering |
101
Voted
DAGSTUHL
2007
15 years 3 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
113
Voted
PAKDD
2009
ACM
15 years 6 months ago
2009
ACM
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
223
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
208
click to vote
WILF
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a novel method aimed to free form deformation
function approximation for purpose of image registration. The
method is currently feature-based. The algorithm i...
100
click to vote
IJCNN
2008
IEEE
15 years 8 months ago
2008
IEEE
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...