4041 search results - page 432 / 809 » time 2009 |
173
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
179
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
293
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
151
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
Block-level continuous data protection (CDP) logs every disk block update so that disk updates within a time window are undoable. Standard file servers and DBMS servers can enjoy...
159
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...