Search Sciweavers | Sciweavers

3 search results - page 1 / 1

» Branch-and-Cut for the Maximum Feasible Subsystem Problem

click to vote

SIAMJO
2008

85views more SIAMJO 2008»

Branch-and-Cut for the Maximum Feasible Subsystem Problem

14 years 10 months ago

Download www.zib.de

Marc E. Pfetsch

claim paper

Read More »

click to vote

ICDCS
2008
IEEE

122views Distributed And Parallel Com...» more ICDCS 2008»

Can We Really Recover Data if Storage Subsystem Fails?

15 years 4 months ago

Download www.ele.uri.edu

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...

Weijun Xiao, Qing Yang

claim paper

Read More »

click to vote

SIAMSC
2008

193views more SIAMSC 2008»

Exact and Approximate Sparse Solutions of Underdetermined Linear Equations

14 years 10 months ago

Download www.matheon.de

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. ...

Sadegh Jokar, Marc E. Pfetsch

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers