Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Self-shadowing is an important factor in the appearance of hair and fur. In this paper we present a new rendering algorithm to accurately compute shadowed hair at interactive rate...
Tom Mertens, Jan Kautz, Philippe Bekaert, Frank Va...
— For the optimal approximation of multivariate Gaussian densities by means of Dirac mixtures, i.e., by means of a sum of weighted Dirac distributions on a continuous domain, a n...
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...