A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
Stefan Gremalschi, Gulsah Altun, Irina Astrovskaya...
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...