Sciweavers

CORR
2008
Springer
65views Education» more  CORR 2008»
13 years 4 months ago
Revisiting Norm Estimation in Data Streams
We revisit the problem of (1
Jelani Nelson, David P. Woodruff
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 6 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
APPROX
2005
Springer
88views Algorithms» more  APPROX 2005»
13 years 10 months ago
Approximating the Best-Fit Tree Under Lp Norms
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
Boulos Harb, Sampath Kannan, Andrew McGregor
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
14 years 2 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff