Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
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.
Imran Nasim, Melanie Weber
SCML 2024
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Andrew Skumanich
SPIE Optics Quebec 1993