2168 search results - page 403 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
EGH
2010
Springer
13 years 5 months ago
2010
Springer
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...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
PERCOM
2004
ACM
14 years 7 months ago
2004
ACM
Large sensor networks in applications such as surveillance and virtual classrooms, have to deal with the explosion of sensor information. Coherent presentation of data coming from...
CASES
2006
ACM
14 years 1 months ago
2006
ACM
Dynamic voltage scaling and sleep state control have been shown to be extremely effective in reducing energy consumption in CMOS circuits. Though plenty of research papers have st...