20 results for “Multidimensional”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper studies the efficiency of allocating indivisible items with multiple attributes to agents with additive valuations.
This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.
This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…
This paper proves that single-vector embeddings require a larger representation size than multi-vector embeddings to approximate certain similarities.
This paper proposes magnitude-based features for analyzing multispecies spatial data.
This paper surveys the rapidly growing body of work on shape space analysis, providing a mathematical and computational framework for studying geometric data.
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
This paper presents an algorithm to generate snake-like polyominoes within a given rectangle and provides exact formulas for the maximal area of such polyominoes for certain dimensions.
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
This paper presents multiword arithmetic, a type of multiprecision arithmetic that uses parallel computing to improve efficiency and accuracy, and provides code implementation in PHCpack.
The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.
This paper introduces Hexels, a novel planar hexagonal surface element for efficient 3D scene and 2D image representation.
The paper investigates applying Riemannian optimization techniques to low-rank matrix parameters for deep learning, but finds that the proposed methods do not conclusively outperform the AdamW baselin…
This paper proves the strong NP-completeness and APX-completeness of the Symmetric Numerical Three-Dimensional Matching problem.