We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Abstract. In this paper we elaborate on a kernel extension to tensorbased data analysis. The proposed ideas find applications in supervised learning problems where input data have ...
Marco Signoretto, Lieven De Lathauwer, Johan A. K....
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
: Over the years, DataWarehousing has gone through a number of evolutions from a relatively simple reporting database to sophisticated analytical applications such as analyzing cus...