7015 search results - page 370 / 1403 » Approximation algorithms for co-clustering |
173
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
190
click to vote
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
167
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
178
click to vote
NIPS
1998
15 years 8 months ago
1998
There has been much recent work on measuring image statistics and on learning probability distributions on images. We observe that the mapping from images to statistics is many-to...
196
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...