We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Abstract—In the paper, we devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the...
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
We present a method of recovering high dynamic range radiance maps from photographs taken with conventional imaging equipment. In our method, multiple photographs of the scene are...