In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
Changbin Yu, Julien M. Hendrickx, Baris Fidan, Bri...
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...