In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Ray–based representations can model complex light transport but are limited in modeling diffraction effects that require the simulation of wavefront propagation. This paper prov...
Se Baek Oh, Sriram Kashyap, Rohit Garg, Sharat Cha...
In this paper, we present a method for the fast and accurate computation of the local cross-correlation of 3D vectorial data. Given spherical patches of 3D vector fields, our meth...
Content-based image retrieval (CBIR) is currently limited because of the lack of representational power of the low-level image features, which fail to properly represent the actual...