Imagen de Portada

A more efficient algorithm to compute the Rand Index for change-point problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Prates, Lucas de Oliveira
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Computation
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quasilinear-time eccentricities computation, and more, on median graphs
por: Bergé, Pierre, et al.
Publicado: (2024)

Parameterized and approximation algorithms for coverings points with segments in the plane
por: Kowalska, Katarzyna, et al.
Publicado: (2024)

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
por: Dumas, Jean-Guillaume, et al.
Publicado: (2026)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

A computational study of Gomory-Hu construction tree algorithms
por: Kolmogorov, Vladimir
Publicado: (2022)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
por: Yang, Yang
Publicado: (2024)

On the closest pair of points problem
por: Hitz, Martin, et al.
Publicado: (2026)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
por: Karczmarz, Adam, et al.
Publicado: (2024)

Faster exponential algorithms for cut problems via geometric data structures
por: Kozma, László, et al.
Publicado: (2025)

An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
por: Yang, Yang
Publicado: (2025)

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
por: Nguyen, Linh Anh
Publicado: (2024)

Round-efficient Fully-scalable MPC algorithms for k-Means
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2026)

A customizable inexact subgraph matching algorithm for attributed graphs
por: Benko, Tatyana, et al.
Publicado: (2025)

Balancing expression dags for more efficient lazy adaptive evaluation
por: Wilhelm, Martin
Publicado: (2017)

A simple and efficient preprocessing step for convex hull problem
por: Heydari, Mohammad, et al.
Publicado: (2023)

The graph alignment problem: fundamental limits and efficient algorithms
por: Ganassali, Luca
Publicado: (2024)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
por: Yang, Connor, et al.
Publicado: (2025)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
por: He, Xi, et al.
Publicado: (2023)

Faster algorithms for packing forests in graphs and related problems
por: Arkhipov, Pavel, et al.
Publicado: (2024)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
por: Armbruster, Alexander, et al.
Publicado: (2025)

An efficient heuristic for approximate maximum flow computations
por: Qian, Jingyun, et al.
Publicado: (2024)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
por: Liu, Gangli
Publicado: (2024)

bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers
por: Guzmán, Benjamín
Publicado: (2026)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
por: Jaberi, Raed, et al.
Publicado: (2024)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
por: Bouland, Adam, et al.
Publicado: (2024)

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

Retroactive Monotonic Priority Queues via Range Searching
por: Castro, Lucas, et al.
Publicado: (2025)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
por: Chakraborty, Srijan, et al.
Publicado: (2025)

On computing the (exact) Fréchet distance with a frog
por: Conradi, Jacobus, et al.
Publicado: (2025)

Finding maximum matchings in RDV graphs efficiently
por: Biedl, Therese, et al.
Publicado: (2024)

DNF formulas are efficiently testable with relative error
por: Chen, Xi, et al.
Publicado: (2026)

An alignment problem
por: McDaniel, Emma L., et al.
Publicado: (2024)

A 0.8395-approximation algorithm for the EPR problem
por: Apte, Anuj, et al.
Publicado: (2025)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
por: Björklund, Andreas, et al.
Publicado: (2025)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
por: Xiao, Hanyin, et al.
Publicado: (2025)

Holonomic equations and efficient random generation of binary trees
por: Lescanne, Pierre
Publicado: (2022)

A practical algorithm for 3-admissibility
por: Awofeso, Christine, et al.
Publicado: (2025)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
por: Dell, Holger, et al.
Publicado: (2022)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Nine lower bound conjectures on streaming approximation algorithms for CSPs
por: Singer, Noah G.
Publicado: (2025)