We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
We show that it is feasible to perform interactive isosurfacing of very large rectilinear datasets with brute-force ray tracing on a conventional (distributed) shared-memory multi...
Steven G. Parker, Peter Shirley, Yarden Livnat, Ch...
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
We describe tools that use measurements from video for the extraction of facial modeling and animation parameters, head tracking, and real-time interactive facial animation. These...
Irfan A. Essa, Sumit Basu, Trevor Darrell, Alex Pe...
E cient and powerful topologically adaptable deformable surfaces can be created by embedding and de ning discrete deformable surface models in terms of an A ne Cell Decomposition (...