Results 31 to 40 of about 855,414 (324)
On the Complexity of Inner Product Similarity Join [PDF]
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016 A number of tasks in classification, information retrieval, recommendation systems, and record linkage reduce to the core problem of inner product similarity join (IPS join): identifying pairs of vectors in a collection that have a sufficiently large inner product.
Ahle, Thomas D. +3 more
openaire +3 more sources
Linear Systems over Join-Blank Algebras [PDF]
, 2017 A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible.
Jananthan, Hayden +2 more
core +2 more sources
Certain operations on interval-valued picture fuzzy graphs with application
International Journal of Mathematics for Industry, 2023 Graph theory has various applications in computer science, such as image segmentation, clustering, data mining, image capturing, and networking. Fuzzy graph (FG) theory has been widely adopted to handle uncertainty in graph-related problems.
Biswajit Das Adhikari +3 more
doaj +1 more source
The dominant strong metric dimension of graphs
AKCE International Journal of Graphs and CombinatoricsGraphs are useful for analyzing the structure models in computer science, operations research, and sociology. Also, different types of graph products have several applications in modeling, including those found in network analysis, communication ...
M. Valiyanpour +2 more
doaj +1 more source
The Sigma Coindex of Graph Operations
Journal of Mathematics, 2021 The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex.
Yasar Nacaroglu
doaj +1 more source
Non-inclusive and inclusive distance irregularity strength for the join product of graphs
Electronic Journal of Graph Theory and Applications, 2022 A function ϕ: V(G)→{1, 2, …, k} of a simple graph G is said to be a non-inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every vertex are distinct and is said to be an inclusive distance ...
Faisal Susanto +3 more
doaj +1 more source
On polyhedral product spaces over polyhedral joins [PDF]
Homology, Homotopy and Applications, 2018 The construction of a simplicial complex given by polyhedral joins (introduced by Anton Ayzenberg), generalizes Bahri, Bendersky, Cohen and Gitler's $J$-construction and simplicial wedge construction. This article gives a cohomological decomposition of a polyhedral product over a polyhedral join for certain families of pairs of simplicial complexes.
openaire +2 more sources
CAT(0) spaces with boundary the join of two Cantor sets
, 2012 We will show that if a proper complete CAT(0) space X has a visual boundary homeomorphic to the join of two Cantor sets, and X admits a geometric group action by a group containing a subgroup isomorphic to Z^2, then its Tits boundary is the spherical ...
Bridson +3 more
core +1 more source
The condition number of join decompositions
, 2018 The join set of a finite collection of smooth embedded submanifolds of a mutual vector space is defined as their Minkowski sum. Join decompositions generalize some ubiquitous decompositions in multilinear algebra, namely tensor rank, Waring, partially ...
Breiding, Paul, Vannieuwenhoven, Nick
core +1 more source
Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer, 2015 ABSTRAK Aljabar relasional sangat membantu adanya kemungkinan penggunaan sintaks bahasa SQL yang berlainan dalam masalah yang sama. Masalah yang digunakan sebagai eksperimen adalah kasus rekapitulasi data mahasiswa layak wisuda pada suatu perguruan ...
Eko Darmanto
doaj +1 more source