Sciweavers

5184 search results - page 988 / 1037
» The digital divide of computing
Sort
View
HOTOS
1993
IEEE
15 years 5 months ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 5 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 5 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
FODO
1993
Springer
110views Algorithms» more  FODO 1993»
15 years 5 months ago
Storage System Architectures for Continuous Media Data
Abstract. Data storage systems are being called on to manage continuous media data types, such as digital audio and video. There is a demand by applications for \constrained-latenc...
David Maier, Jonathan Walpole, Richard Staehli
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 5 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts