Publications related to A Speculation-Friendly Binary Search Tree

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming

Pascal Fua, Engin Türetken, Fethallah Benmansour

Although tracing linear structures in 2D images and 3D image stacks has received much attention over the years, full automation remains elusive. In this paper, we formulate the delineation problem as one of solving a Quadratic Mixed Integer Program (Q-MIP) ...

2012

Corporate structure optimisation for multinational companies

In this paper we consider a multinational corporate structuring problem. This problem involves designing a corporate/organisational structure (across different countries) so as to remit profits from a number of subsidiaries to a single parent company, whil ...

2012

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Pascal Fua, Engin Türetken, Germán González Serrano

We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ours builds a set of candidate trees over many different subsets ...

Humana Press2011

A metric for phylogenetic trees based on matching

Bernard Moret, Yu Lin, Vaibhav Rajan

Comparing two or more phylogenetic trees is a fundamental task in computational biology. The simplest outcome of such a comparison is a pairwise measure of similarity, dissimilarity, or distance. A large number of such measures have been proposed, but so t ...

Springer Verlag2011

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

PLP: Page Latch-free Shared-everything OLTP

Anastasia Ailamaki, Frederick Ryan Johnson, Pinar Tözün, Ippokratis Pandis

Scaling the performance of shared-everything on-line transaction processing to highly-parallel multicore hardware remains a great challenge for database system designers. Developments in OLTP technology remove locking and logging from being scalability bot ...

2011

A power-efficient, current-mode, binary-tree min / max circuit for Kohonen self-organizing feature maps and nonlinear filters

Rafal Tomasz Dlugosz

A novel current-mode, binary-tree Min / Max circuit for application in analog neural networks and filters has been presented. In the proposed circuit input currents are first converted to step signals with equal amplitudes and different delays that are pro ...

2010

Infinite labeled trees: From rational to Sturmian trees

Nicolas Gabriel Gast

This paper studies infinite unordered d-ary trees with nodes labeled by {0,1}. We introduce the notions of rational and Sturmian trees along with the definitions of (strongly) balanced trees and mechanical trees, and study the relations among them. In part ...

Elsevier2010

Optimal decision trees for point location in polytopic data sets - application to explicit MPC

Colin Neil Jones

Explicit Model Predictive Control (EMPC) produces control laws defined over a set of polytopic regions in the state space. In this paper we present a method to create a binary search tree for point location in such polytopic sets, in order to provide a fas ...

2010

Delineating Trees in Noisy 2D Images and 3D Image Stacks

Pascal Fua, François Fleuret, Engin Türetken, Germán González Serrano

We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, our method builds a set of candidate trees over many different subsets of point ...

2010

A Speculation-Friendly Binary Search Tree

Graph Chatbot

Chat with Graph Search

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming

Corporate structure optimisation for multinational companies

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

A metric for phylogenetic trees based on matching

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

PLP: Page Latch-free Shared-everything OLTP

A power-efficient, current-mode, binary-tree min / max circuit for Kohonen self-organizing feature maps and nonlinear filters

Infinite labeled trees: From rational to Sturmian trees

Optimal decision trees for point location in polytopic data sets - application to explicit MPC

Delineating Trees in Noisy 2D Images and 3D Image Stacks

Corporate structure optimisation for multinational companies

A metric for phylogenetic trees based on matching

Optimal decision trees for point location in polytopic data sets - application to explicit MPC

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming

Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

A power-efficient, current-mode, binary-tree min / max circuit for Kohonen self-organizing feature maps and nonlinear filters

Delineating Trees in Noisy 2D Images and 3D Image Stacks

PLP: Page Latch-free Shared-everything OLTP

Infinite labeled trees: From rational to Sturmian trees