d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...