- 博客(1)
- 资源 (3)
- 收藏
- 关注
原创 linux常用解压压缩命令
tar.bz2格式# 解压 tar -jxvf filename.tar.bz2# 压缩 tar -cf some_dir.tar some_dir #to create a .tar file bzip2 -z some_dir.tartar.gz格式# 解压 tar -zxvf filename.tar.gz tar -xvf filename.tar # 压缩 tar -zcvf fi
2016-12-05 18:36:41
170
软件工程 software
1. Web sections These are extra sections that add to the content presented in each
chapter. These web sections are linked from breakout boxes in each chapter.
2. Web chapters There are four web chapters covering formal methods, interaction
design, documentation, and application architectures. I may add other chapters
on new topics during the lifetime of the book.
3. Material for instructors The material in this section is intended to support people
who are teaching software engineering. See the “Support Materials” section
in this Preface.
4. Case studies These provide additional information about the case studies used
in the book (insulin pump, mental health-care system, wilderness weather system)
2011-11-12
Fast sparse matrix multiplication
最快的稀疏矩阵乘法运算,英文版
Let A and B two n £ n matrices over a ring R (e.g., the reals or the integers) each containing at most m
non-zero elements. We present a new algorithm that multiplies A and B using O(m0:7n1:2 + n2+o(1)) algebraic
operations (i.e., multiplications, additions and subtractions) over R. The naive matrix multiplication
algorithm, on the other hand, may need to perform (mn) operations to accomplish the same task. For
m · n1:14, the new algorithm performs an almost optimal number of only n2+o(1) operations. For m · n1:68,
the new algorithm is also faster than the best known matrix multiplication algorithm for dense matrices
which uses O(n2:38) algebraic operations. The new algorithm is obtained using a surprisingly straightforward
combination of a simple combinatorial idea and existing fast rectangular matrix multiplication
algorithms. We also obtain improved algorithms for the multiplication of more than two sparse matrices.
As the known fast rectangular matrix multiplication algorithms are far from being practical, our result, at
least for now, is only of theoretical value.
2011-06-29
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人