Results 121 to 130 of about 28,893 (164)
Some of the next articles are maybe not open access.
Membership Problem with Adjacency Matrix
Computación y Sistemas, 2021In this article, proposed a algorithm to solve the membership problem in Hyperedge Replacement Grammars (HRG). Given a hypergraph H with labeled nodes rooted and directed hyperedges, the problem consists in determining if H 2 L(G), where G is in HRG, this is to say, if H is in the language generated by G, for this the analysis is done directly in the ...
Yolanda Moyao Martinez +3 more
openaire +1 more source
The anti-adjacency matrix of a graph: Eccentricity matrix
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Jianfeng +3 more
openaire +3 more sources
Optical Adjacency Matrix Associative Processor
SPIE Proceedings, 1990A new bidirectional optical associative processor is described for searching a hierarchical database that is stored as an adjacency matrix. The paper discusses how the processor can answer relatively complex queries on a knowledge base when the queries are formulated as combinations of set closures, unions, intersections, and complementations.
David Casasent, Brian Telfer
openaire +1 more source
Arc Adjacency Matrix-Based Fast Ellipse Detection
IEEE Transactions on Image Processing, 2020Fast and accurate ellipse detection is critical in certain computer vision tasks. In this paper, we propose an arc adjacency matrix-based ellipse detection (AAMED) method to fulfill this requirement. At first, after segmenting the edges into elliptic arcs, the digraph-based arc adjacency matrix (AAM) is constructed to describe their triple sequential ...
Cai Meng +3 more
openaire +2 more sources
A Compact Form of the Adjacency Matrix
Journal of Chemical Information and Computer Sciences, 2000It has been shown that the adjacency matrix can be transformed into a row vector and then into a single number. This number can again be decoded to recover the row vector, and this in turn can be decoded to restore the original adjacency matrix. A special, rather efficient coding scheme was devised for acyclic structures.
openaire +2 more sources
Data Clustering by Scaled Adjacency Matrix
2011Similarity based clustering, which is to find the extrinsic clusters in data by taking as input a collection of real-valued similarities between data points, has been playing an important role in data analysis and engineering. Lots of work had been done in this field.
Jian Yu, Caiyan Jia
openaire +1 more source
ADJACENCY MATRIX OF SIGNED SEMIGRAPHS
Advances and Applications in Discrete Mathematics, 2021Surajit Kr. Nath, Ardhendu Kumar Nandi
openaire +1 more source
Digital Filters Using Adjacency Matrix Representation
2008An evolutionary algorithm able to synthesize low-sensitivity digital filters using a chromosome coding scheme based on the adjacency matrix is proposed. It is shown that the proposed representation is more flexible than GP-tree schemes and has a higher search space dimension.
Leonardo Sá, Antonio Mesquita
openaire +1 more source
Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014Masaaki Nishino +3 more
openaire +1 more source