Browsing Theses by Subject "divide and conquer"
Now showing items 1-2 of 2
-
A Scalable Partial-Order Data Structure for Distributed-System Observation
(University of Waterloo, 2001)Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can observe ... -
Shortest Path Queries in Very Large Spatial Databases
(University of Waterloo, 2001)Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly ...