Sciweavers

3019 search results - page 80 / 604
» Approximating the Domatic Number
Sort
View
ICASSP
2011
IEEE
14 years 3 months ago
User admission in MIMO interference alignment networks
In this paper we consider an interference channel where a set of primary active users are cooperating through interference alignment over a constant multiple-input-multiple-output...
Behrang Nosrat-Makouei, Jeffrey G. Andrews, Robert...
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 5 days ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
CP
2005
Springer
15 years 5 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
COMPGEOM
2007
ACM
15 years 3 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev