Results 41 to 50 of about 1,167,245 (202)
Some bounds for the relative generalized Hamming weights of some evaluation codes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree.
Sarabia Manuel González
doaj +1 more source
Remote Sensing, 2021 As satellite observation technology rapidly develops, the number of remote sensing (RS) images dramatically increases, and this leads RS image retrieval tasks to be more challenging in terms of speed and accuracy.
Zhen Wang +4 more
doaj +1 more source
Strong Edge-Coloring of Hamming Graphs
Proceedings of Computer Science and Information Technologies 2023 Conference, 2023 An edge coloring of a graph G is a mapping Á : EG ! N. The edge coloring Á is called strong if Áe 6= Áe0 for any two edges e and e0 that are distance at most one apart. The minimum number of colors needed for a strong edge coloring of a graph G is called strong chromatic index of G and denoted by Â0 sG.
Drambyan, A., Petrosyan, P.
openaire +2 more sources
How Long Can One Bluff in the Domination Game?
Discussiones Mathematicae Graph Theory, 2017 The domination game is played on an arbitrary graph G by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise.
Brešar Boštan +3 more
doaj +1 more source
Sensors, 2022 Cooperative automatic modulation classification (CAMC) using a swarm of sensors is intriguing nowadays as it would be much more robust than the conventional single-sensing-node automatic modulation classification (AMC) method.
Xiao Yan +5 more
doaj +1 more source
Hamming graphs in Nomura algebras
Linear Algebra and its Applications, 2011 Let A be an association scheme on q\geq 3 vertices. We show that the Bose-Mesner algebra of the generalized Hamming scheme H(n,A), for n\geq 2, is not the Nomura algebra of a type II matrix. This result gives examples of formally self-dual Bose-Mesner algebras that are not the Nomura algebras of type II matrices.
Chan, Ada, Munemasa, Akihiro
openaire +2 more sources
Towards Effective Top-N Hamming Search via Bipartite Graph Contrastive Hashing [PDF]
IEEE Transactions on Knowledge and Data EngineeringSearching on bipartite graphs serves as a fundamental task for various real-world applications, such as recommendation systems, database retrieval, and document querying.
Yankai Chen +5 more
semanticscholar +1 more source
Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
AKCE International Journal of Graphs and CombinatoricsInterval function of a graph is a well-known notion in metric graph theory and the axiomatic characterization using a set of first order axioms of different graph classes is an interesting problem in this area.
Jeny Jacob +4 more
doaj +1 more source
Deep Graph-neighbor Coherence Preserving Network for Unsupervised Cross-modal Hashing [PDF]
AAAI Conference on Artificial Intelligence, 2020 Unsupervised cross-modal hashing (UCMH) has become a hot topic recently. Current UCMH focuses on exploring data similarities. However, current UCMH methods calculate the similarity between two data, mainly relying on the two data's cross-modal features ...
Jun Yu, Hao Zhou, Yibing Zhan, D. Tao
semanticscholar +1 more source
EFFICIENT WIDE BASELINE STRUCTURE FROM MOTION [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 This paper presents a Structure from Motion approach for complex unorganized image sets. To achieve high accuracy and robustness, image triplets are employed and (an approximate) camera calibration is assumed to be known.
M. Michelini, H. Mayer
doaj +1 more source