We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Recent local state-of-the-art stereo algorithms based on variable cost aggregation strategies allow for inferring disparity maps comparable to those yielded by algorithms based on ...
Stefano Mattoccia, Simone Giardino, Andrea Gambini
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...