the full version of the extended abstract which appears in Latincrypt '10 (august 8-11, 2010, Puebla, Mexico) M. Abdalla and P. Barreto Eds., Springer-Verlag, LNCS 6212, pages...
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
—Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in IR2 and IR3 . This...
S. M. Nejhum Shahed, Yu-Tseh Chi, Jeffrey Ho, Ming...