Results 111 to 120 of about 1,534,598 (250)
Data structures for set manipulation- hash table, 1986 [PDF]
The most important issue addressed in this thesis is the efficient implementation of hash table methods. There are credential trade-offs in a desired implement ion.
core
VDNeRF: Vision‐Only Dynamic Neural Radiance Field for Urban Scenes
ABSTRACT Neural radiance fields (NeRFs) implicitly model continuous three‐dimensional scenes using a set of images with known camera poses, enabling the rendering of photorealistic novel views. However, existing NeRF‐based methods encounter challenges in applications such as autonomous driving and robotic perception, primarily due to the difficulty of ...
Zhengyu Zou +7 more
wiley +1 more source
ABSTRACT Drug–Drug Interaction (DDI) prediction is critical for ensuring patient safety, particularly under long‐tailed distributions, where frequent (head) interactions dominate whereas rare (tail) interactions remain underrepresented. Conventional loss functions such as cross‐entropy often tend to overfit head classes while they underperform on rare ...
Chao Liu +3 more
wiley +1 more source
This archived document is maintained by the State Library of Oregon as part of the Oregon Documents Depository Program. It is for informational purposes and may not be suitable for legal purposes.Mode of access: Internet from the Oregon Government ...
core
Geo2DGS‐SLAM: Geometry‐Driven SLAM With 2D Gaussian Splatting
ABSTRACT Recent advances in SLAM systems based on 3D Gaussian Splatting have enabled dense and photorealistic scene reconstruction. However, 3DGS‐based methods still suffer from limited geometric awareness due to the lack of normal rendering support, view inconsistency and weak depth constraints, ultimately hindering high‐fidelity geometric ...
Weiqing Yan +4 more
wiley +1 more source
Vertex Hashing Assignment‐Based Distributed Sampling Algorithm for Large‐Scale Dynamic Graph Stream
ABSTRACT In recent years, research on triangle counting in large graphs has primarily focused on estimating the number of triangles in static graphs. Most streaming graph sampling algorithms are only capable of estimating triangle counts in static graphs and cannot handle dynamic graphs.
Yu‐Lin He +3 more
wiley +1 more source
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events).
Herry Sitepu +3 more
doaj
ABSTRACT Severe data starvation, architectural heterogeneity and Byzantine vulnerabilities fundamentally impede the deployment of robust multiclass classification models in decentralised edge environments. To address these intertwined challenges, we propose fusion isomerism learning (FusionIL), a secure and domain‐agnostic framework that ...
Zhihao Hao +5 more
wiley +1 more source
ABSTRACT Telemedicine and healthcare‐IoT require medical image transmission that preserves diagnostic quality and confidentiality under noise, packet loss and cyber threats. Existing methods often separate restoration from security and lack real‐time efficiency.
Mohamed Amine Midoun +5 more
wiley +1 more source
Párhuzamosítható változó hosszú hash függvény
A Paralellizable Variable Length kriptográfiai hash függvény egy változó hosszúsá- gú kimenettel rendelkező iterált hash függvény. Az 1990-ben megjelent Ronald Rivest által megalkotott MD4 algoritmus nagyon jó alappal szolgált a mai napig ...
Bucsay, Balázs
core

