Conference paper
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
The continuous mixing set is S = {(s, r, z) ∈ ℜ × ℜ+n × Zn : s + rj + wj zj ≥ fj, j = 1, ..., n}, where w1, ..., wn > 0 and f1, ..., fn ∈ ℜ. Let m = | {w1, ..., wn} |. We show that when w1 | ⋯ | wn, optimization over S can be performed in time O (nm + 1), and in time O (n log n) when w1 = ⋯ = wn = 1. © 2008 Elsevier B.V. All rights reserved.
Jianke Yang, Robin Walters, et al.
ICML 2023
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
T. Graham, A. Afzali, et al.
Microlithography 2000
Naga Ayachitula, Melissa Buco, et al.
SCC 2007