R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
We present an overview of our ongoing work on parallelizing self-adjusting-computation techniques. In self-adjusting computation, programs can respond to changes to their data (e....
Matthew Hammer, Umut A. Acar, Mohan Rajagopalan, A...
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickso...
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...