AI Chat AI Image Generator AI Video Text to Speech

New Upper Bounds for Trace Reconstruction

09/07/2020

∙

by Zachary Chase, et al.

∙

∙

We improve the upper bound on trace reconstruction to (O(n^1/5)).

page 1

page 2

page 3

page 4

research

∙ 06/16/2020

Another approach to non-repetitive colorings of graphs of bounded degree

We propose a new proof technique that aims to be applied to the same pro...

0 Matthieu Rosenfeld, et al. ∙

research

∙ 05/19/2020

The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace

We present the formula for the number of monic irreducible polynomials o...

0 Yaǧmur Çakıroǧlu, et al. ∙

research

∙ 08/18/2023

Anonymous Refugee Housing with Upper-Bounds

Knop and Schierreich [AAMAS '23] recently introduced a novel model of re...

0 Šimon Schierreich, et al. ∙

research

∙ 07/30/2020

Rademacher upper bounds for cross-validation errors with an application to the lasso

We establish a general upper bound for K-fold cross-validation (K-CV) er...

0 Ning Xu, et al. ∙

research

∙ 11/22/2020

Making mean-estimation more efficient using an MCMC trace variance approach: DynaMITE

The Markov-Chain Monte-Carlo (MCMC) method has been used widely in the l...

0 Cyrus Cousins, et al. ∙

research

∙ 08/17/2021

Reconstruction of Worm Propagation Path Using a Trace-back Approach

Worm origin identification and propagation path reconstruction are essen...

0 Sara Asgari, et al. ∙

research

∙ 04/24/2020

Using monodromy to statistically estimate the number of solutions

Synthesis problems for linkages in kinematics often yield large structur...

0 Jonathan D. Hauenstein, et al. ∙