Imagen de Portada

Impact of local congruences in variable selection from datasets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aragón, Roberto G., Medina, Jesús, Ramírez-Poussa, Eloísa
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Reducing concept lattices by means of a weaker notion of congruence
por: Aragón, Roberto G., et al.
Publicado: (2024)

Trace reconstruction from local statistical queries
por: Chen, Xi, et al.
Publicado: (2024)

Efficient algorithm for linear diophantine equations in two variables
por: Deora, Mayank, et al.
Publicado: (2025)

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
por: Kulik, Ariel, et al.
Publicado: (2019)

The Impact of Approximation on Algorithmic Progress
por: Li, Jeffery, et al.
Publicado: (2026)

MIOV: Reordering MOVI for even better locality
por: Perešíni, Peter, et al.
Publicado: (2024)

Local Gibbs sampling beyond local uniformity
por: Liu, Hongyang, et al.
Publicado: (2025)

Algorithms for the local and the global postage stamp problem
por: Palais, Léo Colisson, et al.
Publicado: (2026)

Sublinear Random Access Generators for Preferential Attachment Graphs
por: Even, Guy, et al.
Publicado: (2016)

Graph Exploration: The Impact of a Distance Constraint
por: Devismes, Stéphane, et al.
Publicado: (2024)

Sampling permutations satisfying constraints within the lopsided local lemma regime
por: He, Kun, et al.
Publicado: (2024)

Similarity analysis of DNA sequences through local distribution of nucleotides in strategic neighborhood
por: Mondal, Probir, et al.
Publicado: (2023)

Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
por: Diaz-Dominguez, Diego
Publicado: (2024)

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
por: Grimes, Olivia, et al.
Publicado: (2025)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
por: Hochbaum, Dorit S., et al.
Publicado: (2025)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
por: Chakraborty, Sankardeep, et al.
Publicado: (2026)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
por: Conte, Alessio, et al.
Publicado: (2024)

Computing finite index congruences of finitely presented semigroups and monoids
por: Anagnostopoulou-Merkouri, Marina, et al.
Publicado: (2023)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
por: Harris, David G.
Publicado: (2021)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
por: Harris, David G.
Publicado: (2023)

Range-Based Set Reconciliation via Range-Summarizable Order-Statistics Stores
por: Amparore, Elvio G.
Publicado: (2026)

QuaRs: A Transform for Better Lossless Compression of Integers
por: Matt, Jonas G.
Publicado: (2025)

Deterministic Dynamic Edge Colouring
por: Christiansen, Aleksander B. G.
Publicado: (2024)

Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks
por: Srikanth, Mithinti, et al.
Publicado: (2024)

Parameterized Linear Time Transitive Closure
por: Kritikakis, Giorgos, et al.
Publicado: (2024)

Improved parallel derandomization via finite automata with applications
por: Giliberti, Jeff, et al.
Publicado: (2024)

Exploration of Always $S$-Connected Temporal Graphs
por: Adamson, Duncan, et al.
Publicado: (2026)

Simple and efficient four-cycle counting on sparse graphs
por: Burkhardt, Paul, et al.
Publicado: (2023)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
por: Hwang, Samuel, et al.
Publicado: (2024)

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
por: de Vos, Tijn, et al.
Publicado: (2024)

Online busy time scheduling with flexible jobs
por: Albers, Susanne, et al.
Publicado: (2024)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
por: Chen, Wenjing, et al.
Publicado: (2026)

Latency Guarantees for Caching with Delayed Hits
por: Gurushankar, Keerthana, et al.
Publicado: (2025)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
por: Chen, Wenjing, et al.
Publicado: (2023)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
por: Adamson, Duncan, et al.
Publicado: (2025)

Sparsity-Parameterised Dynamic Edge Colouring
por: Christiansen, Aleksander B. G., et al.
Publicado: (2023)

A nearly optimal randomized algorithm for explorable heap selection
por: Borst, Sander, et al.
Publicado: (2022)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
por: Harris, David G., et al.
Publicado: (2017)

Towards counterfactual fairness through auxiliary variables
por: Tian, Bowei, et al.
Publicado: (2024)

Realizing temporal transportation trees
por: Mertzios, George B., et al.
Publicado: (2024)