For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
This system paper reports on some of the advantages tangible interaction can bring to chemistry education. The paper describes the realisation of an in-house designed Tangible Use...
An indexing model is the heart of an Information Retrieval (IR) system. Data structures such as term based inverted indices have proved to be very effective for IR using vector sp...