We solve a Laplacian problem over an L-shaped domain using a singular function boundary integral method as well as the p/hp finite element method. In the former method, the soluti...
Morin and Goldman [Computer Aided Geometric Design 17 (2000) 813] have recently presented a remarkable new framework, based on employing Poisson series, for describing analytic fu...
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...