1279 search results - page 153 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
127
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
137
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
110
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
135
click to vote
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
114
click to vote
DICTA
2003
15 years 3 months ago
2003
In this paper we review a number of approaches to reducing, or removing, the problem of shift variance in the discrete wavelet transform (DWT). We describe a generalization of the ...