| 查看: 572 | 回复: 3 | ||
iamdzg木虫 (正式写手)
|
[求助]
麻烦查一下这篇文章的EI检索号
|
|
麻烦查一下这篇文章的EI检索号,谢谢！ Algorithm Research for Vector-linked List Sparse Matrix Multiplication Proceedings 2010 Asia-Pacific Conference on wearable Computing Systems, 2010(4). |
回复此楼» 猜你喜欢
中科院杭州医学所招收博士生一名（生物分析化学、药物递送）
已经有3人回复
-
A期刊撤稿
已经有5人回复
-
临港实验室与上科大联培博士招生1名
已经有8人回复
-
26申博自荐
已经有7人回复
-
想换工作。大多数高校都是 评职称时 认可5年内在原单位取得的成果吗？
已经有4人回复
-
带资进组求博导收留
已经有9人回复
-
求助大佬们，伤口沾上了乙腈
已经有6人回复
-
最近几年招的学生写论文不引自己组发的文章
已经有9人回复
» 本主题相关价值贴推荐，对您同样有帮助:
- 请帮忙查下如下两篇文章的ei检索号 谢谢！
已经有3人回复
- 帮忙查询一篇文章是否被EI或ISTP检索
已经有3人回复
- 帮忙查找下这篇文章是不是EI检索哦
已经有7人回复
- 急求文章的EI检索号(1篇含SCI号），
已经有6人回复
- 各位帮忙查下这两篇文章的EI检索号
已经有3人回复
- 急用！！麻烦能查检索的楼主帮忙检索一下我的7篇文章是否被SCI、EI检索，十分感谢！
已经有7人回复
sys_gao
木虫 (正式写手)
- 应助: 12 (小学生)
- 金币: 6772.8
- 散金: 220
- 红花: 12
- 帖子: 514
- 在线: 248小时
- 虫号: 1776411
- 注册: 2012-04-24
- 性别: GG
- 专业: 计算机软件
【答案】应助回帖
★ ★ ★ ★ ★
iamdzg: 金币+5, ★★★很有帮助, 谢谢! 2012-08-05 14:25:11
iamdzg: 金币+5, ★★★很有帮助, 谢谢! 2012-08-05 14:25:11
|
Accession number: 20102813070530 Title: Algorithm research for vector-linked list sparse matrix multiplication Authors: Hu, Jikuan1 ; Wang, Weiqing1 Author affiliation: 1 Department of Information Management, Southwest University Rongchang Campus, Chongqing, China Corresponding author: Hu, J. (hujikuan@tom.com) Source title: APWCS 2010 - 2010 Asia-Pacific Conference on Wearable Computing Systems Abbreviated source title: APWCS - Asia-Pac. Conf. Wearable Comput. Syst. Monograph title: APWCS 2010 - 2010 Asia-Pacific Conference on Wearable Computing Systems Issue date: 2010 Publication year: 2010 Pages: 118-121 Article number: 5481220 Language: English ISBN-13: 9780769540030 Document type: Conference article (CA) Conference name: 2010 Asia-Pacific Conference on Wearable Computing Systems, APWCS 2010 Conference date: April 17, 2010 - April 18, 2010 Conference location: Shenzhen, China Conference code: 80933 Sponsor: Intelligent Information Technology Application; Research Association Publisher: IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States Abstract: The storage of non-zero elements of sparse matrix in the linked lists can dispense with transpose operation in the multiplication process, because multiplication shall be conducted only for elements in the two sparse matrices whose line number and column number are the same and whose values are not zero. As a result, the number of multiplications will be reduced. In the meantime, the use of linked list to store the elements of matrix will cut back the times of scanning the matrix elements. The theoretical analysis and experimental results show that algorithm of Vector-linked list sparse matrix multiplication has greater time efficiency and needs less storage space. It will lay the foundation for research in the field of image processing. © 2010 IEEE. Number of references: 10 Main heading: Matrix algebra Controlled terms: Image processing - Industrial research - Vector spaces - Vectors - Wearable computers Uncontrolled terms: Cut back - matrix - Matrix elements - Sparse matrices - Storage spaces - Time efficiencies Classification code: 921.1 Algebra - 921 Mathematics - 912.1 Industrial Engineering - 901.3 Engineering Research - 741 Light, Optics and Optical Devices - 723.2 Data Processing and Image Processing - 722.4 Digital Computers and Systems DOI: 10.1109/APWCS.2010.36 Database: Compendex Compilation and indexing terms, © 2012 Elsevier Inc. Full-text and Local Holdings Links |
2楼2012-08-05 12:43:57
|
本帖内容被屏蔽 |
3楼2017-05-26 15:22:38
|
本帖内容被屏蔽 |
4楼2017-06-07 14:56:44