In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
This paper describes an algorithm for approximating missing data in air traffic routes thereby allowing the lengths of different routes to be compared for our simulation analyses....
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
In this paper we introduce a new data gathering method “Web/URL Citation” and use it and Google Scholar as a basis to compare traditional and Web-based citation patterns acros...
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...