Results 61 to 70 of about 111,243 (144)
Factorization theorems for strong maps between matroids of arbitrary cardinality
In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps between finite matroids.
Mao Hua
doaj +1 more source
Multi-View Clustering via Deep Matrix Factorization
Multi-View Clustering (MVC) has garnered more attention recently since many real-world data are comprised of different representations or views. The key is to explore complementary information to benefit the clustering problem.
Handong Zhao, Zhengming Ding, Y. Fu
semanticscholar +1 more source
The reactance wave diffraction problem by a strip in a scale of Bessel potential spaces [PDF]
We consider a boundary-transmission problem for the Helmholtz equation, in a Bessel potential space setting, which arises within the context of wave diffraction theory.
Luís P. Castro, David Natroshvili
doaj
Smarandache Factors And Reverse Factors
This document will describe the current status on the search for factors of Smaranda.che consecutive numbers and their reverse. A complete list up to index 200 will be given, with all known factors. Smarandache numbers are the concatenation of the natural numbers from one up to the given index, and reverse Smaranda.che numbers are the concatenation of ...
openaire +2 more sources
SoRec: social recommendation using probabilistic matrix factorization
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system confronts.
Hao Ma +3 more
semanticscholar +1 more source
Integer Factorization – Cryptology Meets Number Theory
Integer factorization is one of the oldest mathematical problems. Initially, the interest in factorization was motivated by curiosity about behaviour of prime numbers, which are the basic building blocks of all other integers.
Josef Pieprzyk
doaj +1 more source
On a variation of Sands' method
A subset of a finite additive abelian group G is a Z-set if for all a∈G, na∈G for all n∈Z. The group G is called Z-good if in every factorization G=A⊕B, where A and B are Z-sets at least one factor is periodic. Otherwise G is called Z-bad.
Evelyn E. Obaid
doaj +1 more source
3D Imaging of Rapidly Spinning Space Targets Based on a Factorization Method
Three-dimensional (3D) imaging of space targets can provide crucial information about the target shape and size, which are significant supports for the application of automatic target classification and recognition.
Yanxian Bi +3 more
doaj +1 more source
On Twin Edge Colorings of Graphs
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
The Wiener–Hopf perspective on embedding formula: reusing solutions of boundary value problems
Embedding formula allows solutions to be reused within a family of boundary value problems by expressing a family of solutions in terms of a small number of solutions. Such formulas have been previously derived in the context of diffraction by applying a
Andrey I. Korolkov, Anastasia V. Kisil
doaj +1 more source

