We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
Alexander C. Berg, Hao Zhang 0003, Jitendra Malik,...
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a vi...
Background: Modern high throughput experimental techniques such as DNA microarrays often result in large lists of genes. Computational biology tools such as clustering are then us...
Alain B. Tchagang, Alexander Gawronski, Hugo B&eac...
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...