20 results for “vector-free framework”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
The paper introduces S2MDF, a plug-and-play module that enforces a hard constraint to eliminate interpenetrations in multi-object Signed Distance Field (SDF) representations, significantly improving p…
An approach is described to support rigid α canonical variables in an e-graph.
The paper introduces a subgrid marching tetrahedra scheme that accurately recovers complex, intersection-free manifold meshes from tetrahedral grids, overcoming limitations of classic marching methods…
The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.
The paper presents a model of finite algebraic data types as a commutative rig to describe data layouts and their transformations in high-level functional languages.
Ziying Chen, Yang Cao, He Sun, Beining Yang +1 more
The paper proposes a novel geometric embedding hashing method to recover object correspondences (vector links) between two embedding clouds generated by different black-box encoders using only a small…
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
This paper explores five methods for making a linked list work efficiently with multiple threads, from using one big lock to a lock-free design.
The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.
This paper presents algorithms to enumerate and find maximal enclosed vector subspaces in a given set of vectors over a finite field, with a quadratic speed-up compared to brute force.
This paper proves that single-vector embeddings require a larger representation size than multi-vector embeddings to approximate certain similarities.
This paper presents a method for compressing matrices using a RePair straight-line program (SLP), allowing matrix-vector products with time and space proportional to the compressed size, and demonstra…
Weiqi Wang, Peisen Yao, Hanrui Zuo, Yuan Li +2 more
This paper introduces Spear, a parallel synthesis framework for synthesizing optimal abstract transformers for low-level code modeled with fixed-size bit-vectors.
Jieke Shi, Junda He, Wenjia Jiang, Weifeng Sun +10 more
Brevis compresses model checkpoints by synthesizing self-contained DSL programs that reconstruct tensors bit-exactly, reducing storage requirements and achieving high compression and decompression spe…
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
Proposes a programmable architecture for executing multiple non-linear vector normalization operations efficiently.