Sciweavers

847 search results - page 30 / 170
» Approximation algorithms for projective clustering
Sort
View
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
15 years 13 days ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson
ICTAI
2007
IEEE
15 years 5 months ago
Photometric Invariant Projective Registration Using ECC Maximization
The ability of an algorithm to accurately estimate the parameters of the geometric transformation which aligns two image profiles even in the presence of photometric distortions ...
Georgios D. Evangelidis, Emmanouil Z. Psarakis
DAGSTUHL
2007
15 years 15 days ago
Approximating min-max k-clustering
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 ...
Asaf Levin
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
15 years 3 months ago
Clustering with Lower Bound on Similarity
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...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 11 months ago
Exceeding expectations and clustering uncertain data
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...
Sudipto Guha, Kamesh Munagala