Results 11 to 20 of about 135,666 (285)
Mathematics, 2022 The article formulates the Dictionary Recognition problem, which is relevant for a wide range of applied problems: word recognition in a noisy audio signal for natural language processing tasks or in a noisy electromagnetic signal, recognition of visual ...
Alexandra Bernadotte
doaj +1 more source
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
Algorithms, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak of sizes n1×n,…,nk×n, respectively, where D[i1,…,ik] is equal to ∑ℓ=1nA1[i1,ℓ]×…×Ak[ik,ℓ].
Mirosław Kowaluk, Andrzej Lingas
doaj +1 more source
Instruction to the authors of the Journal of Family and Community Medicine
Revista Brasileira de Medicina de Família e Comunidade, 2010 The Journal of Family Medicine and Community RBMFC) is a quarterly publication of the Brazilian Society of Family Medicine and Community, which aims to: raise awareness among professionals and health authorities in the area of interest of Family Medicine
Editor RBMFC
doaj +1 more source
Clique Partitions and Clique Coverings
Discrete Mathematics, 1988 Only undirected graphs without loops or multiple edges are considered here. \(K_n\) is a clique on \(n\) vertices. The clique covering number and the clique partition number of the graph \(G\) is denoted by \(cc(G)\) and \(cp(G)\)respectively. The authors obtain asymptotic results for \(cp(K_n-K_m)\) for m in the range \(\sqrt{n}
Erd'́os, Paul +2 more
openaire +2 more sources
Quantum Clique Gossiping [PDF]
Scientific Reports, 2018 AbstractThis paper establishes a framework of quantum clique gossiping by introducing local clique operations to networks of interconnected qubits. Cliques are local structures in complex networks being complete subgraphs, which can be used to accelerate classical gossip algorithms.
Bo Li +3 more
openaire +3 more sources
Inverse Clique Domination in Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set.
Carmelita Loquias +2 more
doaj +1 more source
On Several Parameters of Super Line Graph
Axioms, 2023 The super line graph of index r, denoted by Lr(G), is defined for any graph G with at least r edges. Its vertices are the sets of r edges of G, and two such sets are adjacent if an edge of one is adjacent to an edge of the other.
Jiawei Meng +2 more
doaj +1 more source
Online Clique Clustering [PDF]
Algorithmica, 2019 Abstract Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be ...
Chrobak, Marek +3 more
openaire +6 more sources
Clique descriptor of affine invariant regions for robust wide baseline image matching [PDF]
, 2010 Assuming that the image distortion between corresponding regions of a stereo pair of images with wide baseline can be approximated as an affine transformation if the regions are reasonably small, recent image matching algorithms have focused on affine ...
Shin, Dongjoe, Tjahjadi, Tardi
core +1 more source
Scientific Reports, 2016 AbstractHigh-diversity species assemblages are very common in nature, and yet the factors allowing for the maintenance of biodiversity remain obscure. The competitive exclusion principle and May’s complexity-diversity puzzle both suggest that a community can support only a small number of species, turning the spotlight on the dynamics of local patches ...
Yael Fried +2 more
openaire +3 more sources