We provide the appropriate common ‘(pre)framework’ for various central results of domain theory and topology, like the Lawson duality of continuous domains, the Hofmann–Lawso...
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
Abstract— We present a path planning algorithm for a polyhedral robot with six degrees of freedom (6DOF) and a static obstacle. The planner consists of a dual-tree RRT algorithm ...
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...