356 search results - page 54 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
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...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...