766 search results - page 79 / 154 » Clustering high dimensional data using subspace and projecte... |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
DKE
2006
13 years 8 months ago
2006
We propose a scalable technique called Seeded Clustering that allows us to maintain R-tree indices by bulk insertion while keeping pace with high data arrival rates. Our approach ...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper, we present a tracking framework for capturing articulated human motions in real-time, without the need for attaching markers onto the subject's body. This is a...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Many applications require matching objects to a predefined, yet highly dynamic set of categories accompanied by category descriptions. We present a novel approach to solving this...