We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
Tae-Joon Kim, Bochang Moon, Duksu Kim, Sung-Eui Yo...
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Given a percentage-threshold and readings from a pair of consecutive upstream and downstream sensors, flow anomaly discovery identifies dominant time intervals where the fractio...
James M. Kang, Shashi Shekhar, Christine Wennen, P...
— Social robots face the fundamental challenge of detecting and adapting their behavior to the current social mood. For example, robots that assist teachers in early education mu...
Abstract— We present and examine a technique for estimating the ego-motion of a mobile robot using memory-based learning and a monocular camera. Unlike other approaches that rely...
Richard Roberts, Hai Nguyen, Niyant Krishnamurthi,...