We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. Most diagrams mentioned in the paper ...
In Computer Science, we have developed a vibrant conference culture, which has served us well thus far. However, with the growth of our field, the number of submissions to many co...
Compiler Design courses are a common component of most modern Computer Science undergraduate curricula. At the same time, however, compiler design has become a highly specialized ...
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...
Tertiary institutions in South Africa are faced with dealing with diversity in all its forms in our classrooms. Information Systems, Information Technology and Computer Science st...
In semantic and object-oriented data models, each class has one or more typing properties that associate it to other classes, and carry type information about all instances of the ...
Anastasia Analyti, Nicolas Spyratos, Panos Constan...
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...