1279 search results - page 71 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
CSDA
2010
13 years 9 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
WOB
2004
13 years 10 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...