:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Gupta, Ishaan, Ayalasomayajula, Samyutha, Shashidhara, Yashas, Kataria, Anish, Shashidhara, Shreyas, Kataria, Krishita, Undurti, Aditya
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Artificial Intelligence 68W03
Acceso en línea:	https://arxiv.org/abs/2312.02254
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

O-Forge: An LLM + Computer Algebra Framework for Asymptotic Analysis
por: Khaitan, Ayush, et al.
Publicado: (2025)

Proof complexity of universal algebra in a CSP dichotomy proof
por: Gaysin, Azza
Publicado: (2024)

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
por: van der Meyden, Ron
Publicado: (2025)

On Covering Euclidean Space with Q-arrangements of Cones
por: Ghorbal, Khalil, et al.
Publicado: (2022)

The Berlekamp-Massey Algorithm revisited
por: Atti, Nadia Ben, et al.
Publicado: (2022)

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
por: Anagnostopoulos, Theodoros, et al.
Publicado: (2026)

State Algebra for Propositional Logic
por: Lesnik, Dmitry, et al.
Publicado: (2025)

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

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

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

Enhanced CAD-Based Quantifier Elimination With Multiple Equational Constraints
por: Davenport, James H., et al.
Publicado: (2026)

Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies
por: Gabbay, Murdoch J.
Publicado: (2025)

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

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

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

Certified Finite-State Induction for a Perturbed Hofstadter Recursion
por: Mantovanelli, Marco
Publicado: (2026)

A Python Framework Enhancement for Neutrosophic Topologies
por: Nordo, Giorgio, et al.
Publicado: (2024)

Exact Constructive Digit-by-Digit Algorithms for Integer $e$-th Root Extraction
por: Pareth, Suresan
Publicado: (2026)

Derandomization with Pseudorandomness
por: Karayel, Emin
Publicado: (2024)

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

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

Calibrated Explanations for Regression
por: Löfström, Tuwe, et al.
Publicado: (2023)

Massively Parallel Reductions in Multivariate Polynomial Systems: Bridging the Symbolic Preprocessing Gap on GPGPU Architectures
por: Gokavarapu, Chandrasekhar
Publicado: (2026)

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

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

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

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

Incremental-Decremental Maximization
por: Disser, Yann, et al.
Publicado: (2025)

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

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

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

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

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

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

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

Robust Classification of Dynamic Bichromatic point Sets in R2
por: Glazenburg, Erwin, et al.
Publicado: (2024)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
por: Lee, Youngkyu, et al.
Publicado: (2023)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
por: Jiang, Wei, et al.
Publicado: (2026)

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

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