Sciweavers

Share
18 search results - page 2 / 4
» Average-case complexity of the min-sum matrix product proble...
Sort
View
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
7 years 4 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
SIAMNUM
2011
139views more  SIAMNUM 2011»
8 years 9 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
COMPSAC
2008
IEEE
9 years 8 months ago
Parallel Table Lookup for Next Generation Internet
The rapid growth of Internet population leads to the shortage of IP addresses. The next generation IP protocol, IPv6, which extends the IP address length from 32 bits to 128 bits,...
Li-Che Hung, Yaw-Chung Chen
CEC
2010
IEEE
9 years 3 months ago
Optimization of biogas production with computational intelligence a comparative study
Biogas plants are reliable sources of energy based on renewable materials including organic waste. There is a high demand from industry to run these plants efficiently, which lead...
Jörg Ziegenhirt, Thomas Bartz-Beielstein, Oli...
STACS
1999
Springer
9 years 6 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
books