Speeding up spatial approximation search in metric spaces
نویسندگان
چکیده
منابع مشابه
Approximation of endpoints for multi-valued mappings in metric spaces
In this paper, under some appropriate conditions, we prove some $Delta$ and strong convergence theorems of endpoints for multi-valued nonexpansive mappings using modified Agarwal-O'Regan-Sahu iterative process in the general setting of 2-uniformly convex hyperbolic spaces. Our results extend and unify some recent results of the current literature.
متن کاملBest Approximation in Metric Spaces
A metric space (X, d) is called an M-space if for every x and y in X and for every r 6 [0, A] we have B[x, r] Cl B[y, A — r] = {2} for some z € X, where A = d(x, y). It is the object of this paper to study M-spaces in terms of proximinality properties of certain sets. 0. Introduction. Let (X, d) be a metric space, and G be a closed subset of X. For x E X, let p(x,G) = inf{d(x, y) : y E G}. If t...
متن کاملSpeeding up tandem mass spectrometry database search: metric embeddings and fast near neighbor search
MOTIVATION Due to the recent advances in technology of mass spectrometry, there has been an exponential increase in the amount of data being generated in the past few years. Database searches have not been able to keep with this data explosion. Thus, speeding up the data searches becomes increasingly important in mass-spectrometry-based applications. Traditional database search methods use one-...
متن کاملSpeeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching o...
متن کاملSimilarity Search in Metric Spaces
Similarity search refers to any searching problem which retrieves objects from a set that are close to a given query object as re ected by some similarity criterion. It has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. In this thesis, we examine algorithms designed for similarity search over arbitrar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2009
ISSN: 1084-6654,1084-6654
DOI: 10.1145/1498698.1564506