Blame Trees by Demaine, Erik D., Panchekha, Pavel, Wilson, David A., Yang, Edward Z.

“…Our results rely on concurrent traversal of two trees with short circuiting when shared subtrees are encountered.…”
Get full text
Get full text

Belga B-Trees by Demaine, Erik D, Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan

Get full text

Belga B-Trees by Demaine, Erik D, Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan

Get full text

Broadcasting on trees near criticality by Gu, Yuzhou, Polyanskiy, Yury, Hosseini Roozbehani, Hajir

“…We revisit the problem of broadcasting on d-ary trees: starting from a Bernoulli(1/2) random variable X 0 at a root vertex, each vertex forwards its value across binary symmetric channels BSC δ to d descendants. …”
Get full text

Combining Binary Search Trees by Demaine, Erik D., Iacono, John, Langerman, Stefan, Ozkan, Ozgur

“…We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “well-behaved” bound on the running time of the given BSTs, for any online access sequence. …”
Get full text
Get full text

Finding Rumor Sources on Random Trees by Shah, Devavrat, Zaman, Tauhid R

“…They establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected (SI) model with exponential spreading times for regular trees. They showed that as the size of the infected graph increases, for a path graph (2-regular tree), the probability of source detection goes to 0 and for d-regular trees with d ≥ 3 the probability of detection, say αd, remains bounded away from 0 and is less than 1/2. …”
Get full text
Get full text
Get full text

The Stackelberg Minimum Spanning Tree Game by Cardinal, Jean, Demaine, Erik D, Fiorini, Samuel, Joret, Gwenaël, Langerman, Stefan, Newman, Ilan, Weimann, Oren

“…This game is the minimum spanning tree analog of the well-studied Stackelberg shortest-path game. …”
Get full text

Robustness verification of tree-based models by Chen, Hongge, Zhang, Huan, Si, Si, Li, Yang, Boning, Duane S, Hsieh, Cho-Jui

“…We study the robustness verification problem for tree based models, including decision trees, random forests (RFs) and gradient boosted decision trees (GBDTs). …”
Get full text

Brownian motion tree models are toric by Sturmfels, Bernd, Uhler, Caroline, Zwiernik, Piotr

“…Felsenstein's classical model for Gaussian distributions on a phylogenetic tree is shown to be a toric variety in the space of concentration matrices. …”
Get full text

Multitask efficiencies in the decision tree model by Drucker, Andrew Donald

“…We focus on the deterministic decision tree model, with depth as the complexity measure; in this model we prove a result to the effect that the 'obvious' constraints on joint computational complexity are essentially the only ones. …”
Get full text

Pareto-optimal phylogenetic tree reconciliation by Libeskind-Hadas, Ran, Wu, Yi-Chieh, Bansal, Mukul S., Kellis, Manolis, Wu, Yi-Chieh

“…Motivation: Phylogenetic tree reconciliation is a widely used method for reconstructing the evolutionary histories of gene families and species, hosts and parasites and other dependent pairs of entities. …”
Get full text

Robust decision trees against adversarial examples by Chen, Hongge, Xhange, Huan, Boning, Duane S, Hsieh, Cho-Jui

“…Although adversarial examples and model robustness have been extensively studied in the context of linear models and neural networks, research on this issue in tree-based models and how to make tree-bascd models robust against adversarial examples is still limited. …”
Get full text

Broadcasting on Trees Near Criticality: Perturbation Theory by Yu, Qian, Polyanskiy, Yury

Get full text

Consistent and efficient reconstruction of latent tree models by Choi, Myung Jin, Tan, Vincent Yan Fu, Anandkumar, Animashree, Willsky, Alan S.

“…We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. …”
Get full text
Get full text

Better approximations for Tree Sparsity in Nearly-Linear Time by Backurs, Arturs, Indyk, Piotr, Schmidt, Ludwig

“…The Tree Sparsity problem is defined as follows: given a node-weighted tree of size n and an integer k, output a rooted subtree of size k with maximum weight. …”
Get full text
Get full text
Get full text
Get full text

Seismic feature extraction using steiner tree methods by Schmidt, Ludwig, Hegde, Chinmay, Indyk, Piotr, Lu, Ligang, Chi, Xingang, Hohl, Detlef

“…This enables us to formulate the feature extraction task as an instance of the Prize-Collecting Steiner Tree problem encountered in combinatorial optimization. …”
Get full text
Get full text
Get full text

An efficient tree decomposition method for permanents and mixed discriminants by Cifuentes, Diego Fernando, Parrilo, Pablo A

Get full text
Get full text
Get full text

Sample-optimal and efficient learning of tree Ising models by Daskalakis, Constantinos, Pan, Qinxuan

Get full text

Tree block coordinate descent for map in graphical models by Sontag, David Alexander, Jaakkola, Tommi S.

Get full text
Get full text

A Magnetic Retrieval System for Stents in the Pancreaticobiliary Tree by Cantillon-Murphy, Padraig, Ryou, Marvin, Shaikh, Sohail N., Azagury, Dan, Ryan, Michele, Thompson, Christopher C., Lang, Jeffrey H.

“…Clinical endoscopic intervention of the pancreaticobiliary tree [endoscopic retrograde cholangiopancreatography (ERCP)] often concludes with the insertion of a temporary plastic stent to reduce the risk of post-ERCP complications by promoting continued flow of bile and pancreatic fluids. …”
Get full text
Get full text
Get full text