3 search results - page 1 / 1 » Branch-and-Cut for the Maximum Feasible Subsystem Problem |
SIAMJO
2008
13 years 4 months ago
2008
ICDCS
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a theoretical and experimental study on the limitations of copy-on-write snapshots and incremental backups in terms of data recoverability. We provide mathemat...
SIAMSC
2008
13 years 4 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...