A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
We take two paradigms for information systems development, functionalism and social relativism, and apply their assumptions to the evaluation of ambient information systems. Ambie...
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...