20 results for “Mahalanobis distance scores”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
A unified detection framework for AI-related content using Mahalanobis distance scores is proposed, including methods for accurate positive class characterization and joint estimation.
The paper provides tight bounds for the OR-rank and an upper bound for the SUM-rank of the unique disjointness matrix.
This paper studies ranking and aggregation under Kendall tau distance with matroid or flag matroid constraints on prefixes.
This paper proves that the min-plus factorization rank and tropical rank of a binary linear code's conditional decoding matrix equal 2^s, where s is the classical state complexity of the minimal trell…
This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.
The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…
The paper proposes two methods for predicting tennis match outcomes using topological data analysis and graph theory. The first method uses lower-star filtration and persistent homology, achieving 66.…
Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more
The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.
The paper introduces and analyzes several novel data appraisal metrics, including the Vendi Score and matrix spectral functions, demonstrating that efficient optimization techniques make these metrics…
This paper presents an index for the maximum segment sum problem with query offset and range, using O(log^2 n) query time and O(n log n) space.
The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…
This paper audits eight automatic scorers for attribution in LLM retrieval-augmented generation and finds that none of them transfer across datasets for generated-answer attribution.
This paper proposes a hierarchical analytical framework to characterize region-level latency differences in Low-Earth orbit satellite Internet using Starlink RTT measurements.
Julien Benchek, Austin Bennett, Jasmin Kern, Ryan Stevens +7 more
APEX-Accounting benchmark is introduced to assess the capability of frontier models in performing accounting tasks. Claude-Fable-5 (Max) outperforms other models with 56.4% Mean Criteria@3.
This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…
Sujith Pulikodan, Agneedh Basu, Saurabh Kumar, Pranav Bhat +4 more
The paper introduces a new inclusive, multimodal Hindi ASR benchmark with real-world recordings and diverse demographic groups, enabling more robust and realistic evaluation.