Results 51 to 60 of about 1,378,752 (293)
Clifford Algebras, Spin Groups and Qubit Trees
Quanta, 2022 Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of superfluous ...
Alexander Yurievich Vlasov
doaj +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Biomass DNA: An Emerging Building Block for Advanced Materials
Advanced Materials, EarlyView.Biomass DNA is rapidly emerging from its traditional role as a genetic blueprint to serve as a versatile abundant, highly programmable polymeric building block. This review highlights the transformation of macroscopic bulk biomass DNA into next generation of functional materials, spanning from dynamic hydrogels, sustainable bioplastics, and high ...
Yuwei Hu, Itamar Willner, Li Niu
wiley +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
Pointed Binary Encompassing Trees [PDF]
, 2004 We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T, that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v $\in$ T is pointed, that is, v has an incident angle greater than $\pi$.
Michael Hoffmann 0001 +2 more
openaire +3 more sources
The Geometry of Binary Search Trees [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 info:eu-repo/semantics ...
Demaine, Erik D. +4 more
openaire +2 more sources
Unlocking Terahertz Steganography: Authentication of Hidden Images in Flexible Media
Advanced Materials Technologies, EarlyView.Hidden information in multilayered devices, such as steganographic portraits, is detected and authenticated using reflection‐mode terahertz time‐domain imaging. Image reconstruction relies on a dedicated figure‐of‐merit obtained by integrating the signal intensity over the time‐window associated with the reflection from the metallic mirror backing the ...
Tiziana Ritacco +4 more
wiley +1 more source
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Algorithms, 2021 Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees.
David Schaller +3 more
doaj +1 more source