Sciweavers

2131 search results - page 178 / 427
» Co-Scheduling of Computation and Data on Computer Clusters
Sort
View
ECCV
2008
Springer
16 years 3 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
ACCV
2009
Springer
15 years 8 months ago
Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach
Abstract. This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well ...
Qi Zhao, Zhi Yang, Hai Tao, Wentai Liu
CVPR
2004
IEEE
16 years 3 months ago
Video Data Mining Using Configurations of Viewpoint Invariant Regions
We describe a method for obtaining the principal objects, characters and scenes in a video by measuring the reoccurrence of spatial configurations of viewpoint invariant features....
Josef Sivic, Andrew Zisserman
CCGRID
2008
IEEE
15 years 8 months ago
A Trusted Data Storage Infrastructure for Grid-Based Medical Applications
Most existing Grid technology has been foremost designed with performance and scalability in mind. When using Grid infrastructure for medical applications, privacy and security co...
Guido van 't Noordende, Sílvia Delgado Olab...
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 10 months ago
On the Comparison of Relative Clustering Validity Criteria.
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
Lucas Vendramin, Ricardo J. G. B. Campello, Eduard...