14518 search results - page 2671 / 2904 » Two Problems for Sophistication |
118
click to vote
OSDI
2006
ACM
16 years 4 months ago
2006
ACM
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...
137
click to vote
OSDI
2006
ACM
16 years 4 months ago
2006
ACM
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
136
click to vote
OSDI
2006
ACM
16 years 4 months ago
2006
ACM
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
138
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
171
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...