:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yezzi-Woodley, Katrina, Calder, Jeff, Sweno, Mckenzie, Siewert, Chloe, Olver, Peter J.
Format:	Preprint
Published:	2022
Subjects:	Computer Vision and Pattern Recognition 68W99, 68U05 D.0; J.0
Online Access:	https://arxiv.org/abs/2205.02691
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stealth edits to large language models
by: Sutton, Oliver J., et al.
Published: (2024)

Symbolic Mathematical Computation 1965--1975: The View from a Half-Century Perspective
by: Corless, Robert M., et al.
Published: (2025)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
by: Gupta, Swati, et al.
Published: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
by: Gupta, Swati, et al.
Published: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
by: Gupta, Swati, et al.
Published: (2023)

Stochastic Function Certification with Correlations
by: Ghuge, Rohan, et al.
Published: (2026)

Pattern matching algorithms in Blockchain for network fees reduction
by: Susik, Robert, et al.
Published: (2022)

Evo* 2025 -- Late-Breaking Abstracts Volume
by: Mora, A. M., et al.
Published: (2025)

Staining and locking computer vision models without retraining
by: Sutton, Oliver J., et al.
Published: (2025)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
by: Feng, Weiming, et al.
Published: (2022)

Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decomposition
by: Pickering, Lynn, et al.
Published: (2023)

Constrained Neural Networks for Interpretable Heuristic Creation to Optimise Computer Algebra Systems
by: Florescu, Dorian, et al.
Published: (2024)

Evo* 2023 -- Late-Breaking Abstracts Volume
by: Mora, A. M., et al.
Published: (2024)

Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CAD
by: del Río, Tereso, et al.
Published: (2024)

Population Protocols Revisited: Parity and Beyond
by: Gąsieniec, Leszek, et al.
Published: (2025)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
by: Caragiannis, Ioannis, et al.
Published: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Amnesiac Flooding: Easy to break, hard to escape
by: Austin, Henry, et al.
Published: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

GLL: A Differentiable Graph Learning Layer for Neural Networks
by: Brown, Jason, et al.
Published: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
by: Rokhlin, Dmitry B.
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

A Systematic Review of Digital Twin-Driven Predictive Maintenance in Industrial Engineering: Taxonomy, Architectural Elements, and Future Research Directions
by: Ismail, Leila, et al.
Published: (2025)

A ZeNN architecture to avoid the Gaussian trap
by: Carvalho, Luís, et al.
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Exascale Multi-Task Graph Foundation Models for Imbalanced, Multi-Fidelity Atomistic Data
by: Pasini, Massimiliano Lupo, et al.
Published: (2026)

A Multi-Stage Automated Online Network Data Stream Analytics Framework for IIoT Systems
by: Yang, Li, et al.
Published: (2022)

SmartEdge: Smart Healthcare End-to-End Integrated Edge and Cloud Computing System for Diabetes Prediction Enabled by Ensemble Machine Learning
by: Hennebelle, Alain, et al.
Published: (2025)