A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
Michael A. Palis, Sanguthevar Rajasekaran, David S...
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
Christopher Amato, Daniel S. Bernstein, Shlomo Zil...
In this paper, we present an algorithm that performs simplification of large geographical maps through a novel use of graphics hardware. Given a map as a collection of non-interse...
Nabil H. Mustafa, Shankar Krishnan, Gokul Varadhan...