Related papers: Maintaining partial sums in logarithmic time

Traditional databases commonly support efficient query and update procedures that operate in time which is sublinear in the size of the database. Our goal in this paper is to take a first step toward dynamic reasoning in probabilistic…

In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of…

A linear time algorithm to find a set of nearest elements in a mesh.

In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In the conventional algorithms, new evidence in absorbed in time…

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

We propose logical characterizations of problems solvable in deterministic polylogarithmic time (PolylogTime) and polylogarithmic space (PolylogSpace). We introduce a novel two-sorted logic that separates the elements of the input domain…

Generalized summability results are obtained regarding formal solutions of certain families of linear moment integro-differential equations with time variable coefficients. The main result leans on the knowledge of the behavior of the…

There has been recent interest in the conditional central limit question for (strictly) stationary, ergodic processes $...,X_{-1},X_0,X_1,...$ whose partial sums $S_n=X_1+...+X_n$ are of the form $S_n=M_n+R_n$, where $M_n$ is a square…

We present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of ${\mathbb Q}_p$ over ${\mathbb Q}$ and gives a finite expansion for every rational number. We also give,…

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

The notion of time is derived as a parameter of statistical ensemble representing the underlying system. Varying population numbers of microstates in statistical ensemble result in different expectation values corresponding to different…

Relations among integrals of logarithms, polylogarithms and Euler sums are presented. A unifying element being the introduction of Nielsen's generalized polylogarithms.

We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.

Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…

We show that certain groups of piecewise linear homeomorphims of the interval are invariably generated.

We present a dynamic data structure that maintains a tree decomposition of width at most $9k+8$ of a dynamic graph with treewidth at most $k$, which is updated by edge insertions and deletions. The amortized update time of our data…

Key to structured prediction is exploiting the problem structure to simplify the learning process. A major challenge arises when data exhibit a local structure (e.g., are made by "parts") that can be leveraged to better approximate the…

We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…

In this paper we consider methods for dynamically storing a set of different objects ("modules") in a physical array. Each module requires one free contiguous subinterval in order to be placed. Items are inserted or removed, resulting in a…

We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of…