Sciweavers

9659 search results - page 1792 / 1932
» Points on Computable Curves
Sort
View
SIGGRAPH
2009
ACM
14 years 4 months ago
RACBVHs: random-accessible compressed bounding volume hierarchies
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...
FOCS
2008
IEEE
14 years 4 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
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:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICDM
2008
IEEE
123views Data Mining» more  ICDM 2008»
14 years 4 months ago
Discovering Flow Anomalies: A SWEET Approach
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...
ICRA
2008
IEEE
190views Robotics» more  ICRA 2008»
14 years 4 months ago
Auditory mood detection for social and educational robots
— 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...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan
ICRA
2008
IEEE
206views Robotics» more  ICRA 2008»
14 years 4 months ago
Memory-based learning for visual odometry
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,...
« Prev « First page 1792 / 1932 Last » Next »