Sciweavers

1068 search results - page 108 / 214
» Factorization as a Rank 1 Problem
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ASPLOS
2009
ACM
15 years 10 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
ESA
2004
Springer
127views Algorithms» more  ESA 2004»
15 years 3 months ago
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
Robert Elsässer, Burkhard Monien, Stefan Scha...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
15 years 10 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
FOCS
2009
IEEE
15 years 4 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff