In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temp...
Yufei Tao, Man Lung Yiu, Dimitris Papadias, Marios...
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
In this paper, we describe an approach for detection and visualization of coordinate term relationships over time and their evolution using temporal data available on the Web. Coor...
Hiroaki Ohshima, Adam Jatowt, Satoshi Oyama, Katsu...