Results 1 to 10 of about 96,691 (218)
Journal of Graph Theory, 2022 AbstractThe dual of a polyhedron is a polyhedron—or in graph‐theoretical terms: the dual of a 3‐connected plane graph is a 3‐connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity of the dual on higher surfaces. Are the duals of 3‐connected embedded graphs of higher genus 3‐connected, too?
Drago Bokal +2 more
openaire +2 more sources
ResiDual: Transformer with Dual Residual Connections
CoRR, 2023 Transformer networks have become the preferred architecture for many tasks due to their state-of-the-art performance. However, the optimal way to implement residual connections in Transformer, which are essential for effective training, is still debated.
Shufang Xie 0003 +8 more
openaire +2 more sources
G-dual Teleparallel Connections in Information Geometry
Information Geometry, 2023 Abstract Given a real, finite-dimensional, smooth parallelizable Riemannian manifold $$(\mathcal {N},G)$$ ( N ,
Florio M. Ciaglia +3 more
openaire +4 more sources
Exploiting dual connectivity in heterogeneous cellular networks [PDF]
2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2017 Appeared in part in IEEE WiOpt ...
Narayan Prasad, Sampath Rangarajan
openaire +2 more sources
Software-Based Implementation of Dual Connectivity for LTE [PDF]
2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems Workshops (MASSW), 2019 This work has been supported by the European Project DualConnectivity Solution for ORCA (DALI) as part of the OpenCall 2 of H2020-ICT-2016-2017 (ORCA) project.
Pupiales Yépez, Carlos +3 more
openaire +2 more sources
Õptimal Dual Vertex Failure Connectivity Labels
CoRR, 2022 DISC ...
Merav Parter, Asaf Petruschka
openaire +4 more sources
MathematicsAn edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices. Some graphs can admit a coloring which is simultaneously rainbow and monochromatic; for instance, any coloring of Kn is rainbow and ...
Mohammed A. Mutar +2 more
openaire +2 more sources
Face Sizes and the Connectivity of the Dual
Journal of Graph TheoryABSTRACTFor each , we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of ‐connected maps. Using these bounds, we determine the smallest genus on which a ‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a ‐connected map can have a ...
Gunnar Brinkmann +2 more
openaire +2 more sources
Dual connectivity for LTE-advanced heterogeneous networks [PDF]
Wireless Networks, 2015 Dual connectivity (DC) allows user equipments(UEs) to receive data simultaneously from different eNodeBs(eNBs) in order to boost the performance in aheterogeneous network with dedicated carrier deployment.Yet, how to efficiently operate with DC opens a number ofresearch questions.
Wang, Hua +2 more
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Introduction Bloodstream infections due to repeated vascular access (VA) puncture and circuit connections remain major concerns in hemodialysis. Therefore, we examined current practices for glove, disinfectant, and personal protective equipment (PPE) use according to VA type in national university hospitals in Japan.
Aiko Yamada +6 more
wiley +1 more source