ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Hexels”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CVcs.AIcs.GREmpiricalRecentOct 27, 2026

Honeycomb-Surfels: Compact Hexagonal Primitives for Efficient Scene Rendering and Reconstruction

Prakhar Kaushik, Soumava Paul, Alan Yuille

This paper introduces Hexels, a novel planar hexagonal surface element for efficient 3D scene and 2D image representation.

View →
cs.CCTheoreticalRecentJun 27, 2026

One Hex reduction to rule them all: Quoridor, Maze Attack, Pinko Pallino and Blockade are PSPACE-complete

Francesco Carboni, Daniele Muscillo

The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.

View →
cs.CRcs.DSApr 6, 2026

Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication

Kemal Mutluergil, Deniz Elbek, Kamer Kaya, Erkay Savaş

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…

View →
cs.ARcs.CRRecentMay 29, 2026

HE^2: A Communication-Light Heterogeneous Architecture for Efficient Fully Homomorphic Encryption

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…

View →
cs.ARcs.CRRecentMay 29, 2026

HE^2: A Communication-Light Heterogeneous Architecture for Efficient Fully Homomorphic Encryption

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…

View →
cs.CGcs.DMcs.DSTheoreticalRecentJun 16, 2026

A Counterexample to Wegner's Conjecture for Axis-Parallel Rectangles

Deepak Ajwani, Rishikesh Gajjala, Rajiv Raman, Saurabh Ray

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.

View →
cs.AIRecentMay 28, 2026

OmniMatBench: A Human-Calibrated Multimodal Reasoning Benchmark Across 19 Materials Science Subfields

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…

View →
cs.OSEmpiricalRecentJul 17, 2026

Scaling Unmodified Multithreaded Applications with Elastic CXL-based Distributed Shared Memory

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…

View →
cs.DCcs.DSTheoreticalRecentAug 13, 2026

Triangle-Free Coloring in LOCAL via Resilient Lovász Local Lemma

Peter Davies-Peck, Xusheng Zhang

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.

View →
math.COcs.DMTheoreticalRecentJul 19, 2026

Strong edge-colouring via local flag algebras

Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang +1 more

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.

View →
math.COcs.CCcs.DMTheoreticalRecentJun 28, 2026

Toward a KKL Theorem for any HDX

Max Hopkins

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.

View →
cs.CCTheoreticalRecentJul 10, 2026

Complexity of the Graph Homomorphism Problem w.r.t. Degeneracy

Grigorii Braulov, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin

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.

View →
cs.ARcs.LGEmpiricalRecentJul 4, 2026

Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout

Senol Gulgonul

This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.

View →
cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
cs.CRMay 13, 2026

HE-PIM: Demystifying Homomorphic Operations on a Real-world Processing-in-Memory System

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…

View →