Image de couverture de livre

The Batch Artifact Scanning Protocol: A new method using computed tomography (CT) to rapidly create three-dimensional models of objects from large collections en masse

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yezzi-Woodley, Katrina, Calder, Jeff, Sweno, Mckenzie, Siewert, Chloe, Olver, Peter J.
Format:	Preprint
Publié:	2022
Sujets:	Computer Vision and Pattern Recognition 68W99, 68U05 D.0; J.0
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Stealth edits to large language models
par: Sutton, Oliver J., et autres
Publié: (2024)

Symbolic Mathematical Computation 1965--1975: The View from a Half-Century Perspective
par: Corless, Robert M., et autres
Publié: (2025)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
par: Gupta, Swati, et autres
Publié: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
par: Gupta, Swati, et autres
Publié: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
par: Gupta, Swati, et autres
Publié: (2023)

Stochastic Function Certification with Correlations
par: Ghuge, Rohan, et autres
Publié: (2026)

Pattern matching algorithms in Blockchain for network fees reduction
par: Susik, Robert, et autres
Publié: (2022)

Evo* 2025 -- Late-Breaking Abstracts Volume
par: Mora, A. M., et autres
Publié: (2025)

Population Protocols Revisited: Parity and Beyond
par: Gąsieniec, Leszek, et autres
Publié: (2025)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
par: Feng, Weiming, et autres
Publié: (2022)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decomposition
par: Pickering, Lynn, et autres
Publié: (2023)

Constrained Neural Networks for Interpretable Heuristic Creation to Optimise Computer Algebra Systems
par: Florescu, Dorian, et autres
Publié: (2024)

Evo* 2023 -- Late-Breaking Abstracts Volume
par: Mora, A. M., et autres
Publié: (2024)

Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CAD
par: del Río, Tereso, et autres
Publié: (2024)

Staining and locking computer vision models without retraining
par: Sutton, Oliver J., et autres
Publié: (2025)

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
par: Caragiannis, Ioannis, et autres
Publié: (2024)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Provability in BI's Sequent Calculus is Decidable
par: Gheorghiu, Alexander, et autres
Publié: (2021)

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

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

A ZeNN architecture to avoid the Gaussian trap
par: Carvalho, Luís, et autres
Publié: (2025)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
par: Rokhlin, Dmitry B., et autres
Publié: (2025)

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

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

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

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

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

GLL: A Differentiable Graph Learning Layer for Neural Networks
par: Brown, Jason, et autres
Publié: (2024)

On sampling two spin models using the local connective constant
par: Efthymiou, Charilaos
Publié: (2024)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

Amnesiac Flooding: Easy to break, hard to escape
par: Austin, Henry, et autres
Publié: (2025)

Robust Classification of Dynamic Bichromatic point Sets in R2
par: Glazenburg, Erwin, et autres
Publié: (2024)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
par: Lee, Youngkyu, et autres
Publié: (2023)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
par: Jiang, Wei, et autres
Publié: (2026)

Exascale Multi-Task Graph Foundation Models for Imbalanced, Multi-Fidelity Atomistic Data
par: Pasini, Massimiliano Lupo, et autres
Publié: (2026)