Tools

"... The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather gen ..."

general case where the similarity criterion defines a metricspace, instead of the more restricted case of a vector space. Many solutions have been proposed in different areas, in many cases without cross-knowledge. Because of this, the same ideas have been reconceived several times, and very different

"... A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."

A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metricspace", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion

"... The goal of approximating metric spaces by more simple metric spaces has led to the notion of graph spanners [PU89, PS89] and to low-distortion embeddings in low-dimensional spaces [LLR94], having many algorithmic applications. This paper provides a novel technique for the analysis of randomized ..."

The goal of approximating metricspaces by more simple metricspaces has led to the notion of graph spanners [PU89, PS89] and to low-distortion embeddings in low-dimensional spaces [LLR94], having many algorithmic applications. This paper provides a novel technique for the analysis of randomized

"... Abstract We consider six self-maps satisfying the condition of commuting and weak compatibility of mappings and the purpose of this paper is to give some common fixed points theorems for complete multiplicative metric space. ..."

Abstract We consider six self-maps satisfying the condition of commuting and weak compatibility of mappings and the purpose of this paper is to give some common fixed points theorems for complete multiplicative metricspace.

"... These slides: available on my web pageExecutive summary Magnitude is a real-valued invariant of metric spaces. It seems not to have been previously investigated. Conjecturally, it captures a great deal of geometric information. It arose from a general study of ‘size ’ in mathematics. Plan 1. Where d ..."

These slides: available on my web pageExecutive summary Magnitude is a real-valued invariant of metricspaces. It seems not to have been previously investigated. Conjecturally, it captures a great deal of geometric information. It arose from a general study of ‘size ’ in mathematics. Plan 1. Where

"... We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are high-dim ..."

We consider the computational problem of finding nearest neighbors in general metricspaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are high