Results 51 to 60 of about 4,703 (164)
On Robust Colorings of Hamming-Distance Graphs [PDF]
The Electronic Journal of Combinatorics, 2018 $H_q(n,d)$ is defined as the graph with vertex set $\mathbb{Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance
Isaiah Harney, Heide Gluesing-Luerssen
openaire +3 more sources
Unveiling Internet Streaming Services: A Comparison Using Neutrosophic Graphs
Fuzzy Information and EngineeringThis paper investigates the inverse of the maximum result obtained by multiplying two unique graph types known as neutrosophic graphs. The main goal is to comprehend a point’s degree in the opposite situation of a neutrosophic graph’s maximum product ...
M. Kaviyarasu
doaj +1 more source
Minimal residual ordinal loss hashing with an adaptive optimization mechanism
EURASIP Journal on Image and Video Processing, 2020 The binary coding technique has been widely used in approximate nearest neighbors (ANN) search tasks. Traditional hashing algorithms treat binary bits equally, which usually causes an ambiguous ranking.
Zhen Wang +3 more
doaj +1 more source
Object-Level Visual-Text Correlation Graph Hashing for Unsupervised Cross-Modal Retrieval
Sensors, 2022 The core of cross-modal hashing methods is to map high dimensional features into binary hash codes, which can then efficiently utilize the Hamming distance metric to enhance retrieval efficiency.
Ge Shi, Feng Li, Lifang Wu, Yukun Chen
doaj +1 more source
Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance
Journal of Applied Mathematics, 2013 In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of source-terminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the
Bingwu Zhang +3 more
doaj +1 more source
Accel-Align: a fast sequence mapper and aligner based on the seed–embed–extend method
BMC Bioinformatics, 2021 Background Improvements in sequencing technology continue to drive sequencing cost towards $100 per genome. However, mapping sequenced data to a reference genome remains a computationally-intensive task due to the dependence on edit distance for dealing ...
Yiqing Yan +2 more
doaj +1 more source
Subdivided graphs as isometric subgraphs of Hamming graphs
European Journal of Combinatorics, 2009 It is proven that given G a subdivision of a clique Kn (n > 0), G is isometrically embeddable in a Hamming graph if and only if G is a partial cube or G=Kn. The characterization for subdivided wheels is also obtained.
Beaudou, Laurent +2 more
openaire +2 more sources
Hamming dimension of a graph—The case of Sierpiński graphs
European Journal of Combinatorics, 2013 The Hamming dimension of a graph G is introduced as the largest dimension of a Hamming graph into which G embeds as an irredundant induced subgraph. An upper bound is proved for the Hamming dimension of Sierpinski graphs S"k^n, k>=3. The Hamming dimension of S"3^n grows as 3^n^-^3.
Sandi Klavzar +2 more
openaire +1 more source
Journal of Integrative Bioinformatics, 2004 We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph visualization. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full ...
Brandes Ulrik, Dwyer Tim, Schreiber Falk
doaj +1 more source
Top Position Sensitive Ordinal Relation Preserving Bitwise Weight for Image Retrieval
Algorithms, 2020 In recent years, binary coding methods have become increasingly popular for tasks of searching approximate nearest neighbors (ANNs). High-dimensional data can be quantized into binary codes to give an efficient similarity approximation via a Hamming ...
Zhen Wang +4 more
doaj +1 more source