Results 41 to 50 of about 71,751 (310)

Classification of eight dimensional perfect forms [PDF]

open access: yes, 2006
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations.
Schuermann, Achill   +2 more
core   +7 more sources

A Parallel Method for Texture Reconstruction in Large-Scale 3D Automatic Modeling Based on Oblique Photography

open access: yesRemote Sensing, 2022
Common methods of texture reconstruction first build a visual list for each triangular face, and then select the best image for each triangular face based on the graph-cut method.
Fei Wang   +5 more
doaj   +1 more source

Probing the topological properties of complex networks modeling short written texts [PDF]

open access: yes, 2014
In recent years, graph theory has been widely employed to probe several language properties. More specifically, the so-called word adjacency model has been proven useful for tackling several practical problems, especially those relying on textual ...
Amancio, Diego R.
core   +4 more sources

Requirements for Topology in 3D GIS [PDF]

open access: yes, 2006
Topology and its various benefits are well understood within the context of 2D Geographical Information Systems. However, requirements in three-dimensional (3D) applications have yet to be defined, with factors such as lack of users' familiarity with the
Ellul, C, Haklay, M
core   +1 more source

ЗБЕРІГАННЯ ІЄРАРХІЧИХ СТРУКТУР В РЕЛЯЦІЙНИХ БАЗАХ ДАНИХ

open access: yesКібербезпека: освіта, наука, техніка, 2022
Системи управління реляційними базами даних і сама мова SQL не мають жодних вбудованих механізмів для зберігання та управління ієрархічними структурами. Існує кілька  різних способів представлення дерев в реляційних базах даних. В роботі розглянуто метод
Volodymyr Markitan   +3 more
doaj   +1 more source

Faster Worst Case Deterministic Dynamic Connectivity [PDF]

open access: yes, 2015
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time $O\left(\sqrt{\frac{n(\log\log n)^2}{\log n}}\right)$ and constant query time.
Kejlberg-Rasmussen, Casper   +3 more
core   +3 more sources

Research on incremental deployment mechanism of network modality for polymorphic network environment

open access: yesDianxin kexue, 2023
Polymorphic networks support diverse network requirements and can coexist, evolve, and change on a unified physical or logical infrastructure in the form of network modality.They can maximize the innovation vitality of network technology driven by new ...
Jiong LI   +4 more
doaj   +2 more sources

Crosslinking in parallel [PDF]

open access: yes, 1992
A crosslink is a double link established between the two entries of an edge in an adjacency list representation of a graph. Crosslinks play important roles in several parallel algorithms as they provide constant time access between the two entries of an ...
Asuri, Hari S.
core  

Phosphatidylinositol 4‐kinase as a target of pathogens—friend or foe?

open access: yesFEBS Letters, EarlyView.
This graphical summary illustrates the roles of phosphatidylinositol 4‐kinases (PI4Ks). PI4Ks regulate key cellular processes and can be hijacked by pathogens, such as viruses, bacteria and parasites, to support their intracellular replication. Their dual role as essential host enzymes and pathogen cofactors makes them promising drug targets.
Ana C. Mendes   +3 more
wiley   +1 more source

A Hybrid Quantum Encoding Algorithm of Vector Quantization for Image Compression

open access: yes, 2006
Many classical encoding algorithms of Vector Quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O(N).
Grover L K   +11 more
core   +1 more source

Home - About - Disclaimer - Privacy