Related papers: Rejoinder of: Treelets--An adaptive multi-scale ba…
Rejoinder of "Calibrated Bayes, for Statistics in General, and Missing Data in Particular" by R. Little [arXiv:1108.1917]
Rejoinder to "The Future of Indirect Evidence" [arXiv:1012.1161]
Rejoinder of "Frequentist coverage of adaptive nonparametric Bayesian credible sets" by Szab\'o, van der Vaart and van Zanten [arXiv:1310.4489v5].
Rejoinder to "Feature Matching in Time Series Modeling" by Y. Xia and H. Tong [arXiv:1104.3073]
Rejoinder to ``Least angle regression'' by Efron et al. [math.ST/0406456]
A few notes about infinite trees in a descriptive set-theoretic setting.
Supplementary Material for "Estimation of a Multiplicative Correlation Structure in the Large Dimensional Case"
Rejoinder to "Quantifying the Fraction of Missing Information for Hypothesis Testing in Statistical and Genetic Studies" [arXiv:1102.2774]
We introduce an adaptive scattered data fitting scheme as extension of local least squares approximations to hierarchical spline spaces. To efficiently deal with non-trivial data configurations, the local solutions are described in terms of…
We describe a new wavelet transform, for use on hierarchies or binary rooted trees. The theoretical framework of this approach to data analysis is described. Case studies are used to further exemplify this approach. A first set of…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
This supplement illustrates application of adaptive observer design from (Tyukin et al, 2013) for systems which are not uniquely identifiable. It also provides an example of adaptive observer design for a magnetic bearings benchmark system…
Rejoinder: Expert Elicitation for Reliable System Design [arXiv:0708.0279]
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*)…
Inspired by coarse-graining approaches used in physics, we show how similar algorithms can be adapted for data. The resulting algorithms are based on layered tree tensor networks and scale linearly with both the dimension of the input and…
Databases, and datasets more generally, evolve continuously through updates, transformations, versioning, schema changes, streaming operations, and other mechanisms. While prior work has noted connections among some of these areas, they…
The need for scalable concurrent ordered set data structures with linearizable range query support is increasing due to the rise of multicore computers, data processing platforms and in-memory databases. This paper presents a new concurrent…
Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…
Traversals are commonly seen in tree data structures, and performance-enhancing transformations between tree traversals are critical for many applications. Existing approaches to reasoning about tree traversals and their transformations are…
A thesis on some recursive Bayesian filters for data assimilation