We all spend time every day looking for information in our email, yet we know little about this refinding process. Some users expend considerable preparatory effort creating compl...
Steve Whittaker, Tara Matthews, Julian A. Cerruti,...
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...