Time domain image interpolation, or image morphing, refers to a class of techniques for generating a set of smoothly changing intermediate images between two given images. Numerou...
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a no...
We discuss a theory for a realistic, applicable scaled genetic algorithm (GA) which converges asymptoticly to global optima in a coevolutionary setting involving two species. It is...