1937 search results - page 235 / 388 » Robust Hierarchical Clustering |
VISSYM
2003
13 years 11 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
ICSP
1993
13 years 11 months ago
1993
Much contemporary development process research is based on analyses of process steps, their duration, and the events they propagate. Our initial research in large, mature telecomm...
COMPUTING
2007
13 years 10 months ago
2007
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
JMLR
2011
13 years 5 months ago
2011
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
ICASSP
2011
IEEE
13 years 2 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...