Results 31 to 40 of about 28,693 (157)
Adaptive User Perspective Rendering for Handheld Augmented Reality
Handheld Augmented Reality commonly implements some variant of magic lens rendering, which turns only a fraction of the user's real environment into AR while the rest of the environment remains unaffected.
Grubert, Jens +4 more
core +1 more source
Graph labelings and their applications [PDF]
Tato práce se zabývá aplikacemi ohodnocení grafů. Existují stovky článků o různých typech ohodnocení grafů. Mnoho odkazů na tyto články je evidováno v přehledovém článku J. A. Galliana.
Ziętek, Valdemar
core
Employing five commuting sets of five-qubit observables, we propose specific 160-661 and 160-21 state proofs of the Bell-Kochen-Specker theorem that are also proofs of Bell's theorem.
Aravind +20 more
core +4 more sources
Moire bands in twisted double-layer graphene
A moire pattern is formed when two copies of a periodic pattern are overlaid with a relative twist. We address the electronic structure of a twisted two-layer graphene system, showing that in its continuum Dirac model the moire pattern periodicity leads ...
A. H. MacDonald +11 more
core +2 more sources
Distance magic labeling on shadow graphs [PDF]
Chaithra Krishna +3 more
openalex +1 more source
Structural characterization of the D290V mutation site in hnRNPA2 low-complexity-domain polymers. [PDF]
Human genetic studies have given evidence of familial, disease-causing mutations in the analogous amino acid residue shared by three related RNA binding proteins causative of three neurological diseases. Alteration of aspartic acid residue 290 of hnRNPA2
Kato, Masato +5 more
core
SCALE method for single-cell ATAC-seq analysis via latent feature extraction. [PDF]
Single-cell ATAC-seq (scATAC-seq) profiles the chromatin accessibility landscape at single cell level, thus revealing cell-to-cell variability in gene regulation.
Gao, Ge +8 more
core
On Distance Magic Harary Graphs
This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for
Paramasivam, Krishnan, Prajeesh, A V
core
For a given graph $G$, the least integer $k\geq 2$ such that for every Abelian group $\mathcal{G}$ of order $k$ there exists a proper edge labeling $f:E(G)\rightarrow \mathcal{G}$ so that $\sum_{x\in N(u)}f(xu)\neq \sum_{x\in N(v)}f(xv)$ for each edge ...
Cichacz, Sylwia, Przybyło, Jakub
core +1 more source
Distance Magic Labeling of Generalised Mycielskian Graphs [PDF]
Pawar, Ravindra, Singh, Tarkehswar
openalex +1 more source

