Sciweavers

9842 search results - page 1676 / 1969
» Compositional timing analysis
Sort
View
IPL
2006
115views more  IPL 2006»
15 years 3 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
ISCA
2006
IEEE
92views Hardware» more  ISCA 2006»
15 years 3 months ago
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
Darshan D. Thaker, Tzvetan S. Metodi, Andrew W. Cr...
ISCI
2006
58views more  ISCI 2006»
15 years 3 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley
CSDA
2007
128views more  CSDA 2007»
15 years 3 months ago
Computational methods for case-cohort studies
Computational methods, which can be implemented using standard Cox regression software, are given for fitting “exact” pseudolikehood estimates and robust and asymptotic varia...
Bryan Langholz, Jenny Jiao
120
Voted
JACM
2006
98views more  JACM 2006»
15 years 3 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
« Prev « First page 1676 / 1969 Last » Next »