In many classification and data-mining applications the user does not know a priori which distance measure is the most appropriate for the task at hand without examining the produ...
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
Recommendation systems suggest items based on user preferences. Collaborative filtering is a popular approach in which recommending is based on the rating history of the system. O...
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...