Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
We introduce perturbation kernels, a new class of similarity measure for information retrieval that casts word similarity in terms of multi-task learning. Perturbation kernels mode...
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
George Papastefanatos, Fotini Anagnostou, Yannis V...
— Diversity techniques are an effective answer to the challenges presented by fading channels. This paper focuses on studying the performance of systems with diversity of three f...