We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
Near-duplicate web documents are abundant. Two such documents differ from each other in a very small portion that displays advertisements, for example. Such differences are irrele...
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
This paper investigates the pre-conditions for successful combination of document representations formed from structural markup for the task of known-item search. As this task is ...
Abstract. Digital Library support for textual and certain types of nontextual documents has significantly advanced over the last years. While Digital Library support implies many a...