Results 1 to 10 of about 1,121,576 (286)
Hypergroups represent a generalization of groups, introduced by Marty, that are rich in applications in several sectors of mathematics and in other fields.
Violeta Leoreanu-Fotea +1 more
doaj +4 more sources
Join Spaces, Soft Join Spaces and Lattices [PDF]
The aim of this paper is to initiate and investigate new (soft) hy-perstructures, particularly (soft) join spaces, using important classes of lattices: modular and distributive.
Leoreanu-Fotea Violeta +3 more
doaj +2 more sources
Flows and joins of metric spaces [PDF]
We introduce the functor * which assigns to every metric space X its symmetric join *X. As a set, *X is a union of intervals connecting ordered pairs of points in X. Topologically, *X is a natural quotient of the usual join of X with itself. We define an
Bourdon +17 more
core +5 more sources
Categorical Join and Generating Families in Diffeological Spaces
We prove that a diffeological space is diffeomorphic to the categorical join of any generating family of plots.
E. Macías, R. Mehrabi
doaj +3 more sources
Crossover operators for molecular graphs with an application to virtual drug screening [PDF]
Genetic algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here,
Nico Domschke +7 more
doaj +2 more sources
Distributed Distance Join Algorithm for Massive Spatial Data [PDF]
Spatial distance join is one of the most common operations for spatial data analysis,which has various application scenarios.Existing distributed methods face the problems of too large space,high data skew,and slow self-join.To this end,this paper ...
WANG Ru-bin, LI Rui-yuan, HE Hua-jun, LIU Tong, LI Tian-rui
doaj +1 more source
Metric space similarity joins [PDF]
Similarity join algorithms find pairs of objects that lie within a certain distance ϵ of each other. Algorithms that are adapted from spatial join techniques are designed primarily for data in a vector space and often employ some form of a multidimensional index.
Edwin H. Jacox, Hanan Samet
openaire +1 more source
Efficient Sentiment-Aware Web Crawling Methods for Constructing Sentiment Dictionary
In traditional web crawling, all web pages crawled are first stored to databases. As a result, this approach can store unnecessary web pages and requires additional running time for the construction of a sentiment dictionary in a particular domain ...
Byung-Won On +5 more
doaj +1 more source
Joins of double coset spaces [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhattarai, H. N., Fernandez, J. W.
openaire +2 more sources
Universal extensions of specialization semilattices [PDF]
A specialization semilattice is a join semilattice together with a coarser preorder ⊑ satisfying an appropriate compatibility condition. If X is a topological space, then (P(X),∪,⊑) is a specialization semilattice, where x ⊑ y if x ⊆ Ky, for x, y ⊆ X ...
Paolo Lipparini
doaj +1 more source

