A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
The paper presents an overview of financial applications of copulas. Copulas permit to represent joint distribution functions by splitting the marginal behavior, embedded in the ma...