705 search results - page 73 / 141 » Proximity Cluster Trees |
NIPS
2003
13 years 9 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
ISPDC
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
IV
2008
IEEE
14 years 2 months ago
2008
IEEE
The recent revolution of digital camera technology has resulted in much larger collections of images. Image browsing techniques thus become increasingly important for overview and...