We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
We give a counterexample to a conjecture by Wild about binary matroids. We connect two equivalent lines of research in matroid theory: a simple type of basis-exchange property and ...
Abstract— The European High-Performance Information Infrastructure in Medicine, nB3014 (HIM3) project of the Trans-European Network—Integrated Broadband Communications (TEN-IB...
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...