Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
Given a set of n points (nodes) on a line and a set of m weighted intervals defined on the nodes, we consider a particular dynamic programming (DP) problem on these intervals. If the weight function of the DP has convex or concave property, we can solve this DP problem efficiently by using matrix searching in Monge matrices, together with a new query data structure, which we call the consecutive query structure. We invoke our algorithm to obtain fast algorithms for sequential partition of a graph and for maximum K-clique of an interval graph. © 1998 Elsevier Science B.V. All rights reserved.
Jianke Yang, Robin Walters, et al.
ICML 2023
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007