179 search results - page 26 / 36 » Alternation-Trading Proofs, Linear Programming, and Lower Bo... |
ICALP
2004
Springer
14 years 27 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
TIT
2010
13 years 2 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
ECOOP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...
EOR
2002
13 years 7 months ago
2002
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...