The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
In this poster we describe alternative inverted index structures that reduce the time required to process queries, produce a higher query throughput and still return high quality ...
Paul Ferguson, Alan F. Smeaton, Cathal Gurrin, Pet...
Current search engines do not support user searches for chemical entities (chemical names and formulae) beyond simple keyword searches. Usually a chemical molecule can be represen...
The state of the art in visual object retrieval from large databases is achieved by systems that are inspired by text retrieval. A key component of these approaches is that local ...
James Philbin, Ondrej Chum, Michael Isard, Josef S...
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...