1110 search results - page 83 / 222 » New Approximation Results for Resource Replication Problems |
ICASSP
2011
IEEE
14 years 2 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...
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
SIAMDM
2002
14 years 10 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
127
click to vote
STRINGOLOGY
2004
15 years 17 days ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
DCOSS
2008
Springer
15 years 29 days ago
2008
Springer
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...