556 search results - page 80 / 112 » A Comparative Study of Some Generalized Rough Approximations |
PODS
1995
ACM
14 years 18 hour ago
1995
ACM
d abstract Marc Andries, Leiden University Luca Cabibbo, University of Romey Jan Paredaens, University of Antwerpz Jan Van den Bussche, INRIAx In the context of object databases...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
PODS
2000
ACM
14 years 25 days ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...