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

20 results for “Maximal area”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.DMTheoreticalRecentJun 11, 2026

Snake Polyominoes of Maximal Area in a Rectangle

Alexandre Blondin Massé, Alain Goupil

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.

View →
cs.CGRecentMay 29, 2026

How Many Slopes Does Polynomial Area Cost?

Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Maria Eleni Pavlidi

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View →
cs.PFcs.ARcs.DCRecentMay 28, 2026

From Roofline to Ruggedness: Decomposing and Smoothing the GEMM Performance Landscape

Aditya Chatterjee

The paper introduces performance ruggedness analysis to quantify performance variance in GEMM workloads, proposing a two-stage software stack that significantly smooths the performance landscape and b…

View →
cs.CVcs.AIRecentJun 1, 2026

Parameter-Efficient Fine-Tuning of Large Pretrained Models for Instance Segmentation Tasks

Nermeen Abou Baker, David Rohrschneider, Uwe Handmann

This paper investigates the application of Parameter-Efficient Fine-Tuning (PEFT) methods, specifically adapters and LoRA, to large pretrained models for instance segmentation, demonstrating that thes…

View →
cs.CVRecentJun 1, 2026

PRIMA: Boosting Animal Mesh Recovery with Biological Priors and Test-Time Adaptation

Xiaohang Yu, Ti Wang, Mackenzie Weygandt Mathis

PRIMA is a framework that significantly improves 3D quadruped mesh recovery by integrating biological knowledge and a test-time adaptation strategy, achieving state-of-the-art results on diverse and c…

View →
cs.LGcs.CLcs.CRRecentMay 18, 2026

Protection Is (Nearly) All You Need: Structural Protection Dominates Scoring in Globally Capped KV Eviction

Gabriel Garcia

The paper demonstrates that structural protection mechanisms are the dominant factor in maintaining high performance for KV cache eviction policies, often surpassing the benefits of complex scoring al…

View →
cs.CVRecentJun 1, 2026

Honey, I Shrunk the Arc de Triomphe!

Yuanbo Xiangli, Hanyu Chen, Xueqing Tsang, Noah Snavely

The paper introduces MetricScenes, a new large-scale, in-the-wild dataset, and demonstrates that fine-tuning existing geometry models on this dataset significantly mitigates the scale-collapse problem…

View →
cs.AIRecentMay 27, 2026

Verifiable Benchmarking of Long-Horizon Spatial Biology

Ian Diks, Harihara Muralidharan, Tim Proctor, Kenny Workman

The paper introduces SpatialBench-Long, a comprehensive benchmark designed to test AI agents' ability to perform end-to-end scientific reasoning and derive biological claims from complex, raw spatial…

View →
cs.NEcs.LGRecentJun 3, 2026

U-Net-Accelerated Quality-Diversity Optimization for Climate-Adaptive Urban Layouts

Alexander Hagg, Tania Guerrero, Dirk Reith

The paper introduces a U-Net deep learning surrogate model to accelerate Quality-Diversity optimization for urban layout design, demonstrating that this spatial approach enables highly accurate climat…

View →
cs.NEcs.AIEmpiricalRecentJun 10, 2026

SPEA2$^+$: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees

Duc-Cuong Dang, Andre Opris, Dirk Sudholt

The paper conducts a runtime analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2) and proposes an improved variant, SPEA2$^+$, to address its limitations in handling dominated solutions.

View →
math.OCcs.AIcs.NERecentMay 27, 2026

Preference-Shaped Expected Hypervolume and R2 Improvement: Exact Computation and Monotonicity

Michael T. M. Emmerich

The paper analyzes preference-shaped expected improvement criteria for Bayesian multiobjective optimization, precisely characterizing when transformations preserve key properties like exact computatio…

View →
cs.CRcs.SERecentMar 20, 2026

Byte-level Object Bounds Protection

Piyus Kedia

PRISM is a novel, precise object-bounds protection scheme that significantly reduces runtime overhead by encoding the object's end address directly into the pointer tag, thereby eliminating costly met…

View →
cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
cs.GRcs.CGRecentMay 30, 2026

Subgrid Marching Tetrahedra

Hossein Baktash, Mark Gillespie, Keenan Crane

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…

View →
cond-mat.mtrl-scics.CEcs.CLRecentMay 29, 2026

A Padding Method for Enhanced Encoding of Inorganic Structures with Varying Chemical Compositions

Thang Dang, Haderbache Amir, Tzanakakis Alexandros, Yoshimoto Yuta

The paper introduces a novel padding method that leverages crystal symmetry to enhance the encoding of complex inorganic structures, significantly improving the generation of stable, novel materials.

View →
cs.CCRecentMay 31, 2026

Recursive Jump Operators and Optimal Proof Systems

Fabian Egidy

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…

View →
cs.CRquant-phRecentApr 17, 2026

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$

Ming-Xing Luo

This paper provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.

View →
cs.ROcs.AIRecentMay 28, 2026

Extreme dynamic symmetry enables omnidirectional and multifunctional robots

Jiaxun Liu, Boxi Xia, Boyuan Chen

The paper introduces and demonstrates that leveraging dynamic symmetry—the uniformity of attainable center-of-mass accelerations—significantly enhances a robot's agility, robustness, and multifunction…

View →
cs.CRcs.DScs.ITRecentMay 27, 2026

Optimal Rates for Differentially Private Hypothesis Testing with E-values

Ben Jacobsen, Tomas Gonzalez, Gavin Brown, Kassem Fawaz +1 more

The paper characterizes the optimal achievable rate for differentially private hypothesis testing using e-values, providing an exact algorithm for both fixed and sequential settings.

View →