traction Problem for PCF Hyland-Ong games model Concrete Representation Compositional Semantics? A Concrete Representation of Observational Equivalence for PCF Martin Churchill, Ji...
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresp...
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
In this work we study the asymptotic traffic behaviour for Gromov's hyperbolic networks as the size of the network increases. We prove that under certain mild hypothesis the t...