Results 71 to 80 of about 520,046 (284)
Advanced Functional Materials, EarlyView.Oxygen‐tunnel (OT) indium tin oxide (ITO) vertical channel transistors (VCTs) enable reliable, high‐density gain‐cell memory for monolithic 3D integration. A sandwiched SiN/SiO2/SiN OT stack selectively regulates oxygen transport, suppressing parasitic electrode oxidation while stabilizing channel oxygen vacancies, thereby suppressing carrier injection
Hyeonho Gu +17 more
wiley +1 more source
Depth order estimation for video frames using motion occlusions
IET Computer Vision, 2014 This study proposes a system to estimate the depth order of regions belonging to a monocular image sequence. For each frame, the regions are ordered according to their relative depth using information from the previous and following frames. The algorithm
Guillem Palou, Philippe Salembier
doaj +1 more source
The Binary Space Partitioning-Tree Process [PDF]
, 1988 The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the partitions to be axis-aligned, its modelling flexibility is limited.
Fan, Xuhui +2 more
core +7 more sources
Advanced Functional Materials, EarlyView.This work introduces a swelling‐induced, stress‐assisted water‐soluble PVA tape strategy to transfer‐print nanodiamond quantum‐sensor arrays onto soft, curved biological interfaces. The room‐temperature, water‐triggered process achieves >98% fidelity and residue‐free integration, enabling conformal quantum sensing on contact lenses, neural probes, and ...
Luyao Zhang +9 more
wiley +1 more source
Limit Laws for Functions of Fringe trees for Binary Search Trees and Recursive Trees [PDF]
, 2014 We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree and the random ...
Holmgren, Cecilia, Janson, Svante
core
How unprovable is Rabin's decidability theorem?
, 2015 We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A. +6 more
core +1 more source
Permutations in Binary Trees and Split Trees.
, 2018 We investigate the number of permutations that occur in random node labellings of trees. This is a generalisation of the number of subpermutations occuring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees [Cai et al., 2017].
Michael Albert 0001 +3 more
openaire +3 more sources
Advanced Healthcare Materials, EarlyView.The incorporation of nondigested ECM and synthetic polymers into a co‐electrospinning system enables the decoupling of bioactivity and mechanical properties within a single wrap. This technique is used to develop a multifunctional bone wrap that achieves augmented membrane durability, sustained infection control, and enhanced vascularity for use in ...
Sarah Jones +14 more
wiley +1 more source
Non-Contiguous Pattern Avoidance in Binary Trees
, 2012 In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results ...
Dairyko, Michael +3 more
core
Constructing Binary Huffman Tree
Formalized Mathematics, 2013 Summary Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm.
Hiroyuki Okazaki +2 more
openaire +3 more sources