We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
We consider minimal-rate sampling schemes for streams of delayed and weighted versions of a known pulse shape. Such signals belong to the class of finite rate of innovation (FRI) m...
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...