Tootfinder

Unsupervised Airway Tree Clustering with Deep Learning: The Multi-Ethnic Study of Atherosclerosis (MESA) Lung Study
Sneha N. Naik, Elsa D. Angelini, R. Graham Barr, Norrina Allen, Alain Bertoni, Eric A. Hoffman, Ani Manichaikul, Jim Pankow, Wendy Post, Yifei Sun, Karol Watson, Benjamin M. Smith, Andrew F. Laine
https://arxiv.org…

Unsupervised Airway Tree Clustering with Deep Learning: The Multi-Ethnic Study of Atherosclerosis (MESA) Lung Study
High-resolution full lung CT scans now enable the detailed segmentation of airway trees up to the 6th branching generation. The airway binary masks display very complex tree structures that may encode biological information relevant to disease risk and yet remain challenging to exploit via traditional methods such as meshing or skeletonization. Recent clinical studies suggest that some variations in shape patterns and caliber of the human airway tree are highly associated with adverse health ou…

This https://arxiv.org/abs/2309.08315 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

i-Octree: A Fast, Lightweight, and Dynamic Octree for Proximity Search
Establishing the correspondences between newly acquired points and historically accumulated data (i.e., map) through nearest neighbors search is crucial in numerous robotic applications. However, static tree data structures are inadequate to handle large and dynamically growing maps in real-time. To address this issue, we present the i-Octree, a dynamic octree data structure that supports both fast nearest neighbor search and real-time dynamic updates, such as point insertion, deletion, and on-…

Comparison results for Markov tree distributions
Jonathan Ansari, Moritz Ritter
https://arxiv.org/abs/2404.17441 https://arxiv.org/pd…

Comparison results for Markov tree distributions
We develop comparison results for Markov tree distributions extending ordering results from the literature on discrete time Markov processes and recently studied ordering results for conditionally independent factor models to tree structures. Based on fairly natural positive dependence conditions, our main contribution is a comparison result with respect to the supermodular order. Since this order is a pure dependence order, it has many applications in optimal transport, finance, and insurance.…

Root-to-Leaf Scheduling in Write-Optimized Trees
Christopher Chung, William Jannen, Samuel McCauley, Bertrand Simon
https://arxiv.org/abs/2404.17544 https:…

Root-to-Leaf Scheduling in Write-Optimized Trees
Write-optimized dictionaries are a class of cache-efficient data structures that buffer updates and apply them in batches to optimize the amortized cache misses per update. For example, a B^epsilon tree inserts updates as messages at the root. B^epsilon trees only move ("flush") messages when they have total size close to a cache line, optimizing the amount of work done per cache line written. Thus, recently-inserted messages reside at or near the root and are only flushed down the tree after a…

This https://arxiv.org/abs/2310.01717 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Ensemble Distillation for Unsupervised Constituency Parsing
We investigate the unsupervised constituency parsing task, which organizes words and phrases of a sentence into a hierarchical structure without using linguistically annotated data. We observe that existing unsupervised parsers capture differing aspects of parsing structures, which can be leveraged to enhance unsupervised parsing performance. To this end, we propose a notion of "tree averaging," based on which we further propose a novel ensemble method for unsupervised parsing. To improve infer…

PASCL: Supervised Contrastive Learning with Perturbative Augmentation for Particle Decay Reconstruction
Junjian Lu, Siwei Liu, Dmitrii Kobylianski, Etienne Dreyer, Eilam Gross, Shangsong Liang
https://arxiv.org/abs/2402.11538

PASCL: Supervised Contrastive Learning with Perturbative Augmentation for Particle Decay Reconstruction
In high-energy physics, particles produced in collision events decay in a format of a hierarchical tree structure, where only the final decay products can be observed using detectors. However, the large combinatorial space of possible tree structures makes it challenging to recover the actual decay process given a set of final particles. To better analyse the hierarchical tree structure, we propose a graph-based deep learning model to infer the tree structure to reconstruct collision events. In…

This https://arxiv.org/abs/2311.09168 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGR_…

Arkade: k-Nearest Neighbor Search With Non-Euclidean Distances using GPU Ray Tracing
High-performance implementations of $k$-Nearest Neighbor Search ($k$NN) in low dimensions use tree-based data structures. Tree algorithms are hard to parallelize on GPUs due to their irregularity. However, newer Nvidia GPUs offer hardware support for tree operations through ray-tracing cores. Recent works have proposed using RT cores to implement $k$NN search, but they all have a hardware-imposed constraint on the distance metric used in the search -- the Euclidean distance. We propose and impl…

SAT-based Learning of Computation Tree Logic
Adrien Pommellet, Daniel Stan, Simon Scatton
https://arxiv.org/abs/2402.06366 https://ar…

SAT-based Learning of Computation Tree Logic
The CTL learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing CTL formula that is verified by the former but not by the latter. Further constraints may bound the size and shape of the desired formula or even ask for its minimality in terms of syntactic size. This synthesis problem is motivated by explanation generation for dissimilar models, e.g. comparing a faulty implementation with the original protocol. We devise a SAT-based enco…

Log-structured merge-tree databases rely on a combination of in-memory buffers and hierarchies of immutable on-disk structures, two cases where a trie data structure is most efficient. Attend Branimir Lambov's talk at this year's Berlin Buzzwords to see how Apache Cassandra uses and benefits from this combination. #bbuzz

This https://arxiv.org/abs/1808.06106 has been replaced.
link: https://scholar.google.com/scholar?q=a

Construction of Kuranishi structures on the moduli spaces of pseudo holomorphic disks: II
This is the second of a series of two articles in which we provide detailed and self-contained account of the construction of a system of Kuranishi structures on the moduli spaces of pseudo holomorphic disks. Using the notion of obstruction bundle data introduced in [FOOO8], we give a systematic way of constructing a system of Kuranishi structures on the moduli spaces of pseudo holomorphic disks which are compatible at the boundary and corners. More specifically, it defines a tree like K-system…

This https://arxiv.org/abs/1711.08265 has been replaced.
link: https://scholar.google.com/scholar?q=a

Sparse Variable Selection on High Dimensional Heterogeneous Data with Tree Structured Responses
We consider the problem of sparse variable selection on high dimension heterogeneous data sets, which has been taking on renewed interest recently due to the growth of biological and medical data sets with complex, non-i.i.d. structures and huge quantities of response variables. The heterogeneity is likely to confound the association between explanatory variables and responses, resulting in enormous false discoveries when Lasso or its variants are naïvely applied. Therefore, developing effecti…

This https://arxiv.org/abs/2311.15511 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Enumeration and Succinct Encoding of AVL Trees
We use a novel decomposition to create succinct data structures -- supporting a wide range of operations on static trees in constant time -- for a variety tree classes, extending results of Munro, Nicholson, Benkner, and Wild. Motivated by the class of AVL trees, we further derive asymptotics for the information-theoretic lower bound on the number of bits needed to store tree classes whose generating functions satisfy certain functional equations. In particular, we prove that AVL trees require …

This https://arxiv.org/abs/2402.06366 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

SAT-based Learning of Computation Tree Logic
The CTL learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing CTL formula that is verified by the former but not by the latter. Further constraints may bound the size and shape of the desired formula or even ask for its minimality in terms of syntactic size. This synthesis problem is motivated by explanation generation for dissimilar models, e.g. comparing a faulty implementation with the original protocol. We devise a SAT-based enco…

Structures associated with the Borromean rings complement in the Poincar\'e ball
Anton A. Nazarenko, A. V. Nazarenko
https://arxiv.org/abs/2404.02615 h…

Structures associated with the Borromean rings complement in the Poincaré ball
Guided by physical needs, we deal with the rotationally isotropic Poincaré ball, when considering the complement of Borromean rings embedded in it. We consistently describe the geometry of the complement and realize the fundamental group as isometry subgroup in three dimensions. Applying this realization, we reveal normal stochastization and multifractal behavior within the examined model of directed random walks on the rooted Cayley tree, whose graphs are associated with dendritic polymers. A…

This https://arxiv.org/abs/1711.08265 has been replaced.
link: https://scholar.google.com/scholar?q=a

Sparse Variable Selection on High Dimensional Heterogeneous Data with Tree Structured Responses
We consider the problem of sparse variable selection on high dimension heterogeneous data sets, which has been taking on renewed interest recently due to the growth of biological and medical data sets with complex, non-i.i.d. structures and huge quantities of response variables. The heterogeneity is likely to confound the association between explanatory variables and responses, resulting in enormous false discoveries when Lasso or its variants are naïvely applied. Therefore, developing effecti…

This https://arxiv.org/abs/2402.06366 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

SAT-based Learning of Computation Tree Logic
The CTL learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing CTL formula that is verified by the former but not by the latter. Further constraints may bound the size and shape of the desired formula or even ask for its minimality in terms of syntactic size. This synthesis problem is motivated by explanation generation for dissimilar models, e.g. comparing a faulty implementation with the original protocol. We devise a SAT-based enco…

This https://arxiv.org/abs/2304.03985 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

On Rotation Distance of Rank Bounded Trees
Computing the rotation distance between two binary trees with $n$ internal nodes efficiently (in $poly(n)$ time) is a long standing open question in the study of height balancing in tree data structures. In this paper, we initiate the study of this problem bounding the rank of the trees given at the input (defined by Ehrenfeucht and Haussler (1989) in the context of decision trees). We define the rank-bounded rotation distance between two given binary trees $T_1$ and $T_2$ (with $n$ internal no…

This https://arxiv.org/abs/2401.14295 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Demystifying Chains, Trees, and Graphs of Thoughts
The field of natural language processing (NLP) has witnessed significant progress in recent years, with a notable focus on improving large language models' (LLM) performance through innovative prompting techniques. Among these, prompt engineering coupled with structures has emerged as a promising paradigm, with designs such as Chain-of-Thought, Tree of Thoughts, or Graph of Thoughts, in which the overall LLM reasoning is guided by a structure such as a graph. As illustrated with numerous exampl…

This https://arxiv.org/abs/2304.03985 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

On Rotation Distance of Rank Bounded Trees
Computing the rotation distance between two binary trees with $n$ internal nodes efficiently (in $poly(n)$ time) is a long standing open question in the study of height balancing in tree data structures. In this paper, we initiate the study of this problem bounding the rank of the trees given at the input (defined by Ehrenfeucht and Haussler (1989) in the context of decision trees). We define the rank-bounded rotation distance between two given binary trees $T_1$ and $T_2$ (with $n$ internal no…

This https://arxiv.org/abs/2402.06366 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

SAT-based Learning of Computation Tree Logic
The CTL learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing CTL formula that is verified by the former but not by the latter. Further constraints may bound the size and shape of the desired formula or even ask for its minimality in terms of syntactic size. This synthesis problem is motivated by explanation generation for dissimilar models, e.g. comparing a faulty implementation with the original protocol. We devise a SAT-based enco…

This https://arxiv.org/abs/2404.02615 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Structures associated with the Borromean rings complement in the Poincaré ball
Guided by physical needs, we deal with the rotationally isotropic Poincaré ball, when considering the complement of Borromean rings embedded in it. We consistently describe the geometry of the complement and realize the fundamental group as isometry subgroup in three dimensions. Applying this realization, we reveal normal stochastization and multifractal behavior within the examined model of directed random walks on the rooted Cayley tree, whose graphs are associated with dendritic polymers. A…

This https://arxiv.org/abs/2103.02343 has been replaced.
link: https://scholar.google.com/scholar?q=a

Provability in BI's Sequent Calculus is Decidable
Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications. As a consequence, contexts in the sequent presentation are not lists, nor multisets, but rather tree-like structures called bunches. This additional complexity notwithstanding, the logic has a well-behaved metatheory admitting all the familiar forms of semant…