6348 search results - page 1269 / 1270 » A Lesson for Software Engineering from Knowledge Engineering |
156
Voted
SIAMJO
2011
14 years 4 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
138
Voted
ASPLOS
2012
ACM
13 years 9 months ago
2012
ACM
Dynamic binary translation (DBT) is a powerful technique that enables fine-grained monitoring and manipulation of an existing program binary. At the user level, it has been emplo...
128
Voted
EUROSYS
2007
ACM
15 years 10 months ago
2007
ACM
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
131
Voted
EUROSYS
2007
ACM
15 years 10 months ago
2007
ACM
Two oft-cited file systems, the Fast File System (FFS) and the Log-Structured File System (LFS), adopt two sharply different update strategies—update-in-place and update-out-of-...
127
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...