3096 search results - page 85 / 620 » The Generalized FITC Approximation |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
ECAI
2006
Springer
14 years 13 days ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
OL
2010
13 years 3 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...