1209 search results - page 205 / 242 » Approximation by pseudo-linear operators |
174
click to vote
USENIX
2007
15 years 8 months ago
2007
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public’s desire to digitally record their per...
200
click to vote
FAST
2004
15 years 7 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
181
click to vote
VMV
2004
15 years 7 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
134
click to vote
WIESS
2000
15 years 7 months ago
2000
As IPC mechanisms become faster, stub-code efficiency becomes a performance issue for local client/server RPCs and inter-component communication. Inefficient and unnecessary compl...
185
Voted
SOSP
1997
ACM
15 years 7 months ago
1997
ACM
The idealdistributed file system wouldprovide all its userswith coherent,shared access tothe samesetoffiles,yetwould be arbitrarily scalable to provide more storage space and hi...