We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
— Many novel spatio-temporal applications deal with moving objects. In such environments, a database typically maintains the initial position and the moving function for each obj...
Marios Hadjieleftheriou, George Kollios, Vassilis ...
In this paper, we report about the design, development, and implementation of the SEPIA cooperative hypermedia authoring environment. It provides results on the following aspects ...
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...