Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Interruptible rendering is a novel approach to the fidelity-versusperformance tradeoff ubiquitous in real-time rendering. Interruptible rendering unifies spatial error, caused by ...
Cliff Woolley, David P. Luebke, Benjamin Watson, A...
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfa...