Related papers: Improved Upper Bounds for Pairing Heaps

This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…

Deep ensembles are a powerful tool in machine learning, improving both model performance and uncertainty calibration. While ensembles are typically formed by training and tuning models individually, evidence suggests that jointly tuning the…

Time delay estimation has long been an active area of research. In this work, we show that compressive sensing with interpolation may be used to achieve good estimation precision while lowering the sampling frequency. We propose an…

We present a new method for analyzing the running time of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel running time. This allows…

Leftist heaps and skew heaps are two well-known data structures for mergeable priority queues. Leftist heaps are constructed for efficiency in the worst-case sense whereas skew heaps are self-adjusting, designed for efficiency in the…

The EHP and the MCAP provide new rigorous weak variational formalism for a broad range of initial boundary value problems in mathematical physics and mechanics. Both approaches utilize the mixed formulation and lead to the development of…

A new Combined Sieve algorithm is presented with cost proportional to the number of enumerated factors over a series of intervals. This algorithm achieves a significant speedup, over a traditional sieve, when handling many ([10^4, 10^7])…

We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…

Applying the theory of compressive sensing in practice always takes different kinds of perturbations into consideration. In this paper, the recovery performance of greedy pursuits with replacement for sparse recovery is analyzed when both…

Robotic affordance estimation is challenging due to visual, geometric, and semantic ambiguities in sensory input. We propose a method that disambiguates these signals using two coupled recursive estimators for sub-aspects of affordances:…

The transfer operator corresponding to a uniformly expanding map enjoys good spectral properties. Here it is verified that coupling yields explicit estimates that depend continuously on the expansion and distortion constants of the map. For…

We point out that EXP3 can be implemented in constant time per round, propose more practical algorithms, and analyze the trade-offs between the regret bounds and time complexities of these algorithms.

It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any…

This work explores the intersection of time-delay embeddings, periodic orbit theory, and symbolic dynamics. Time-delay embeddings have been effectively applied to chaotic time series data, offering a principled method to reconstruct…

Coupled parametric oscillators were recently employed as simulators of artificial Ising networks, with the potential to solve computationally hard minimization problems. We demonstrate a new dynamical regime within the simplest network -…

We consider mixed-integer optimal control problems with combinatorial constraints that couple over time such as minimum dwell times. We analyze a lifting and decomposition approach into a mixed-integer optimal control problem without…

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

We consider the one-parameter family of interval maps arising from generalized continued fraction expansions known as alpha-continued fractions. For such maps, we perform a numerical study of the behaviour of metric entropy as a function of…

We introduce a mixed discontinuous/continuous finite element pair for ocean modelling, with continuous quadratic pressure/layer depth and discontinuous velocity. We investigate the finite element pair applied to the linear shallow-water…

Cuckoo hashing is a highly practical dynamic dictionary: it provides amortized constant insertion time, worst case constant deletion time and lookup time, and good memory utilization. However, with a noticeable probability during the…