Sciweavers

963 search results - page 19 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
PPOPP
2010
ACM
15 years 9 months ago
Scaling LAPACK panel operations using parallel cache assignment
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
Anthony M. Castaldo, R. Clint Whaley
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
15 years 4 months ago
Optimal Index and Data Allocation in Multiple Broadcast Channels
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and f...
Shou-Chih Lo, Arbee L. P. Chen
TMC
2010
138views more  TMC 2010»
14 years 10 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
EUROPAR
2004
Springer
15 years 5 months ago
Improving Data Cache Performance via Address Correlation: An Upper Bound Study
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
Peng-fei Chuang, Resit Sendag, David J. Lilja
90
Voted
ICALP
2003
Springer
15 years 5 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf