Sciweavers

Share
18 search results - page 3 / 4
» Average-case complexity of the min-sum matrix product proble...
Sort
View
WCE
2007
9 years 4 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
COMPGEOM
2006
ACM
9 years 9 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
CORR
2008
Springer
106views Education» more  CORR 2008»
9 years 3 months ago
Quantum walk based search algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
Miklos Santha
SIAMSC
2016
3 years 11 months ago
Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case
We study the rank structures of the matrices in Fourier- and Chebyshev-spectral methods for differential equations with variable coefficients in one dimension. We show analyticall...
Jie Shen, Yingwei Wang, Jianlin Xia
CORR
2008
Springer
108views Education» more  CORR 2008»
9 years 3 months ago
Linear Processing and Sum Throughput in the Multiuser MIMO Downlink
We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multipleoutput (MIMO) system, wherein each user may receive more than one data stream. We ...
Adam J. Tenenbaum, Raviraj S. Adve
books