Results 31 to 40 of about 2,194,803 (325)
Finite-Time Amplitudes In Matrix Theory [PDF]
, 1997 We evaluate one-loop finite-time amplitudes for graviton scattering in Matrix theory and compare to the corresponding amplitudes in supergravity.
Abramowitz +8 more
core +2 more sources
Max–min distance nonnegative matrix factorization
Neural Networks, 2015 Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples.
Wang, Jim Jing-Yan, Gao, Xin
openaire +3 more sources
Determining finite connected graphs along the quadratic embedding constants of paths
Electronic Journal of Graph Theory and Applications, 2021 The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Edy Tri Baskoro, Nobuaki Obata
doaj +1 more source
The bipartite Laplacian matrix of a nonsingular tree
Special Matrices, 2023 For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B. +2 more
doaj +1 more source
The calculation of the distance to a nearby defective matrix [PDF]
, 2012 In this paper a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam & Bora (Linear Algebra Appl., 396 (2005), pp.~273--301) and reduces to finding when a ...
Freitag, Melina A., Spence, Alastair
core +1 more source
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Improved forecasts for the baryon acoustic oscillations and cosmological distance scale [PDF]
, 2007 We present the cosmological distance errors achievable using the baryon acoustic oscillations as a standard ruler. We begin from a Fisher matrix formalism that is upgraded from Seo & Eisenstein (2003).
Daniel J. Eisenstein +4 more
core +2 more sources
Generalized Kruithof approach for traffic matrix estimation [PDF]
, 2006 [Abstract]: In this paper, the traffic matrix estimation problem is formulated as an nonlinear optimization problem based on the generalized Kruithof approach which uses the Kullback distance to measure the probabilistic distance between two traffic ...
Eum, Suyong +2 more
core +1 more source
An Enumeration of the Equivalence Classes of Self-Dual Matrix Codes
, 2015 As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes, space-time codes over ...
Morrison, Katherine
core +1 more source
Proceedings of the International Conference on Applied Innovations in IT, 2018 The process automation is one of the effective approaches to process management based on the use of information technology at the present stage of the society development.
Julia Dubrovskaya +3 more
doaj +1 more source