Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
Background: Searching for approximate patterns in large promoter sequences frequently produces an exceedingly high numbers of results. Our aim was to exploit biological knowledge ...
Stefania Bortoluzzi, Alessandro Coppe, Andrea Biso...
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Abstract. We present MinervaDL, a digital library architecture that supports approximate information retrieval and filtering functionality under a single unifying framework. The a...
Christian Zimmer, Christos Tryfonopoulos, Gerhard ...