545 search results - page 57 / 109 » Simultaneous approximation by greedy algorithms |
141
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
139
Voted
ICN
2005
Springer
15 years 9 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
135
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
149
Voted
HIPC
2007
Springer
15 years 10 months ago
2007
Springer
Many real-world applications like Video-On-Demand (VOD) and Web servers require prompt responses to access requests. However, with an explosive increase of data volume and the emer...
129
click to vote
MMS
2006
15 years 3 months ago
2006
Vision systems are increasingly being deployed to perform complex surveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important tha...