We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over ...
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Localization is one of the fundamental problems in mobile robotics. Without knowledge about their position mobile robots cannot e ciently carry out their tasks. In this paper we pr...
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...