20 results for “k-convex polyominoes”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper studies a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers, and develops a data-driven algorithm to learn parameters and op…
The paper provides the conjectured solution for the generating function of k-convex polyominoes, based on analysis of generated enumeration data.
This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.
This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.
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.
The paper shows that the envy-free cake-cutting problem with three agents is intractable and establishes the first lower bounds for the Jordan curve problem.
The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…
The paper analyzes preference-shaped expected improvement criteria for Bayesian multiobjective optimization, precisely characterizing when transformations preserve key properties like exact computatio…
Ting Hou, Yanhao Wang, Yiping Wang, Cen Chen +2 more
This paper addresses the challenging problem of multi-objective submodular maximization under a cardinality constraint while ensuring differential privacy, proposing novel algorithms with approximatio…
This paper settles the complexity of three sketching problems in graphs and distributions.
The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…
The paper characterizes the minimax optimal excess-risk rate for pure $\varepsilon$-DP stochastic convex optimization with heavy-tailed gradients, providing an algorithm that achieves this rate.
The paper introduces PolyVeil, a protocol for private Boolean summation that uses permutation matrices in the Birkhoff polytope, achieving strong security guarantees while highlighting a fundamental t…
The paper introduces a unified theoretical framework for gradient aggregation in multi-objective optimization, establishing convergence rates and sufficient conditions for achieving Pareto stationarit…
The paper develops a unified theoretical framework to systematically characterize the optimal privacy-utility trade-off (PUT) and optimal Local Differential Privacy (LDP) channels for general statisti…
The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…
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…
The paper formally models structure-informed multiple sequence alignment (MSA-S) as an NP-complete optimization problem, establishing a strong computational complexity baseline for the field.
The paper introduces a Variational Encrypted Model Predictive Control (VEMPC) protocol that enables online MPC execution using only encrypted polynomial operations, eliminating the need for intermedia…