Image de couverture de livre

A divide and conquer strategy for multinomial particle filter resampling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Popov, Andrey A.
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Quantum divide and conquer
par: Childs, Andrew M., et autres
Publié: (2022)

On the quantum time complexity of divide and conquer
par: Allcock, Jonathan, et autres
Publié: (2023)

ZOR filters: fast and smaller than fuse filters
par: Limasset, Antoine
Publié: (2026)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time
par: Lancia, Giuseppe, et autres
Publié: (2024)

A more efficient algorithm to compute the Rand Index for change-point problems
par: Prates, Lucas de Oliveira
Publié: (2021)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
par: Prokopenko, Andrey, et autres
Publié: (2024)

Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale: a self-calibrated randomized solution
par: Wu, Changye, et autres
Publié: (2018)

A Simple Proof that Ricochet Robots is PSPACE-Complete
par: Balanza-Martinez, Jose, et autres
Publié: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

Fast Matrix Multiplication via Ternary Meta Flip Graphs
par: Perminov, A. I.
Publié: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
par: Tate, Elise, et autres
Publié: (2025)

Learning Functions of Halfspaces
par: Alman, Josh, et autres
Publié: (2026)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
par: Jansen, Bart M. P., et autres
Publié: (2026)

DNF formulas are efficiently testable with relative error
par: Chen, Xi, et autres
Publié: (2026)

Detecting Low-Degree Truncation
par: De, Anindya, et autres
Publié: (2024)

A Deterministic Partition Tree and Applications
par: Wang, Haitao
Publié: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

A Dichotomy Theorem for Multi-Pass Streaming CSPs
par: Fei, Yumou, et autres
Publié: (2025)

Testing noisy low-degree polynomials for sparsity
par: Bao, Yiqiao, et autres
Publié: (2025)

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges
par: Frei, Fabian, et autres
Publié: (2024)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
par: Frei, Fabian, et autres
Publié: (2025)

Lower Bounds for Convexity Testing
par: Chen, Xi, et autres
Publié: (2024)

A Space-space Trade-off for Directed st-Connectivity
par: Edenhofer, Roman
Publié: (2026)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
par: Konstantinovsky, Thomas, et autres
Publié: (2026)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
par: Lehner, Lisa, et autres
Publié: (2025)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
par: Fomin, Fedor V., et autres
Publié: (2024)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
par: Ducoffe, Guillaume
Publié: (2026)

A data structure for monomial ideals with applications to signature Gröbner bases
par: Lairez, Pierre, et autres
Publié: (2026)

A Unified Approach to Memory-Sample Tradeoffs for Detecting Planted Structures
par: Garg, Sumegha, et autres
Publié: (2026)

Sublinear-query relative-error testing of halfspaces
par: Chen, Xi, et autres
Publié: (2026)

Sliding Cubes in Parallel
par: Akitaya, Hugo A., et autres
Publié: (2026)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
par: Gholizadeh, Hossein, et autres
Publié: (2025)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
par: Ebbens, Matthijs, et autres
Publié: (2024)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)