Sciweavers

1008 search results - page 14 / 202
» Minimizing Average Flow-Time
Sort
View
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 3 months ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth
JMLR
2010
161views more  JMLR 2010»
13 years 3 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
FCT
2001
Springer
14 years 1 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
ICC
2009
IEEE
133views Communications» more  ICC 2009»
14 years 3 months ago
Reducing Average Power in Wireless Sensor Networks through Data Rate Adaptation
—The use of variable data rate can reduce network latency and average power consumption, and automatic rate selection is critical for improving scalability and minimizing network...
Steven Lanzisera, Ankur Mehta, Kristofer S. J. Pis...
GLOBECOM
2007
IEEE
14 years 2 months ago
Joint Reduction of Peak-to-Average Power Ratio and Out-of-Band Power in OFDM Systems
—The high peak-to-average power ratio is a major drawback of OFDM systems. Many PAPR reduction techniques have been proposed in the literature, among them a method that uses a su...
Martin Senst, Markus Jordan, Meik Dorpinghaus, Mic...