Results 161 to 170 of about 18,520 (199)

Similarity Join in Metric Spaces

Lecture Notes in Computer Science, 2003
Similarity join in distance spaces constrained by the metric postulates is the necessary complement of more famous similarity range and the nearest neighbors search primitives. However, the quadratic computational complexity of similarity joins prevents from applications on large data collections.
Vlastislav Dohnal, Claudio Gennaro, Pasquale Savino   +2 more
exaly   +4 more sources

Chordal graphs and join spaces

Journal of Geometry, 1989
A join space is composed of a set J and a join operation \(\circ\) in J subject to certain axioms reflecting the fundamental properties of line segments in Euclidean space. The join operation \(\circ\) is a mapping from \(J\times J\) to the family of subsets of J. It means that two endpoints determine a segment. An ``inverse'' operation / is defined by
Juhani Nieminen
exaly   +3 more sources

Bases in semilinear spaces over join-semirings

Fuzzy Sets and Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue-Ping Wang
exaly   +2 more sources

Binary relations, interval structures and join spaces

Journal of Applied Mathematics and Computing, 2002
An interval structure can be represented by a binary relation. A hyperoperation is defined on a set equipped with a binary relation. In this paper the hyperstructures based on the related interval structures are studied. Some necessary and sufficient conditions on these hyperstructures to be hypergroups, join spaces and \(H_v\)-groupoids are obtained.
Piergiulio Corsini
exaly   +3 more sources

Geometrics and Join Spaces.

Journal Fur Die Reine Und Angewandte Mathematik, 1972
Walter Prenowitz
exaly   +2 more sources

Join Spaces, Canonical Hypergroups and Lattices

2022
exaly   +2 more sources

Quicker Similarity Joins in Metric Spaces

2013
We consider the join operation in metric spaces. Given two sets A and B of objects drawn from some universe $\mathbb U$ , we want to compute the set $A \Join B = \{a,b \in A \times B\;|\;da,b \leq r\}$ efficiently, where $d : \mathbb U \times \mathbb U \to \mathbb R^+$ is a metric distance function and r∈ℝ+ is user supplied query ...
Braithwaite Billy, Fredriksson Kimmo
openaire   +1 more source

Join space graphs

Journal of Geometry, 1988
A join space is an abstract model for partially ordered linear, spherical and projective geometries. A connected graph is a join space if and only if it is a strong prime convex intersection graph.
openaire   +1 more source

Join strategies using data space partitioning

New Generation Computing, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esen A. Ozkarahan, Cem H. Bozsahin
openaire   +1 more source