We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
Robert Herzog, Vlastimil Havran, Shin-ichi Kinuwak...
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Cardiac magnetic resonance (MR) imaging has advanced to become a powerful diagnostic tool in clinical practice. Automatic detection of anatomic landmarks from MR images is importan...
Xiaoguang Lu, Bogdan Georgescu, Arne Littmann, Edg...
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...