20 results for “Hexels”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces Hexels, a novel planar hexagonal surface element for efficient 3D scene and 2D image representation.
The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.
This paper proposes methods to optimally permute the rows and columns of a sparse matrix to minimize the number of cyclic diagonals required for homomorphic sparse-matrix vector multiplication, signif…
Shangyi Shi, Husheng Han, Zhaoxuan Kan, Yinghao Yang +7 more
The paper proposes $HE^2$, a novel communication-light heterogeneous accelerator architecture that significantly improves the efficiency of Fully Homomorphic Encryption (FHE) by optimizing dataflow an…
Shangyi Shi, Husheng Han, Zhaoxuan Kan, Yinghao Yang +7 more
The paper proposes $HE^2$, a novel communication-light heterogeneous accelerator architecture that significantly improves the efficiency of Fully Homomorphic Encryption (FHE) by optimizing dataflow an…
The authors provide a counterexample to Wegner's conjecture on the minimum number of points needed to pierce all rectangles in a family of axis-parallel rectangles.
Wanhao Liu, Jiaqing Xie, Qian Tan, Weida Wang +9 more
The paper introduces OmniMatBench, a comprehensive, human-calibrated multimodal reasoning benchmark covering 19 materials science subfields, revealing that current multimodal language models (MLLMs) h…
Guowei Liu, Kang Chen, Laiping Zhao, Yiming Li +6 more
xDSM is a full-space, elastic DSM system built over CXL that transparently scales unmodified multithreaded applications by employing an OS-runtime co-design, dynamic data placement policy, and spatial…
This paper adapts the distributed triangle-free coloring algorithm of Pettie and Su to solve LLL instances in logarithmic rounds, eliminating the LLL steps as the bottleneck.
This paper uses local flag algebra to prove bounds on the strong chromatic index of graphs, making progress towards established conjectures for general, bipartite, and asymmetric bipartite graphs.
This paper introduces a local-to-global method for analyzing low influence functions on simplicial complexes and proves a local-to-global KKL-type Theorem.
This paper studies the complexity of the graph homomorphism problem in terms of the degeneracy of the target graph and shows that under ETH, there is no efficient algorithm for this problem.
This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
Harshita Gupta, Mayank Kabra, Jaewoo Park, Priyam Mehta +8 more
The paper characterizes Homomorphic Encryption (HE) operations on a real-world Processing-In-Memory (PIM) system, demonstrating that while PIM is a viable alternative to CPUs/GPUs, performance is limi…