Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
We combine the description logic ALC with the metric logics defined Entities that are conceived of as abstract points in the realm of ALC are given a spatial extension via an `ext...
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
Piotr Indyk, Avner Magen, Anastasios Sidiropoulos,...
Conservative adaptation consists in a minimal change on a source case to be consistent with the target case, given the domain knowledge. It has been formalised in a previous work t...
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability m...
Robert Krauthgamer, James R. Lee, Manor Mendel, As...
We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent u...