725 search results - page 58 / 145 » A General Greedy Approximation Algorithm with Applications |
DOLAP
2005
ACM
14 years 11 months ago
2005
ACM
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...
IPL
2008
14 years 9 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
ALT
2004
Springer
15 years 6 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
CGF
2002
14 years 9 months ago
2002
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...