检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

194 篇 会议
22 篇 期刊文献

馆藏范围

216 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

212 篇 工学
- 212 篇 计算机科学与技术...
- 175 篇 软件工程
- 16 篇 生物工程
- 10 篇 电气工程
- 8 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 6 篇 控制科学与工程
- 3 篇 机械工程
- 2 篇 农业工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 林业工程
173 篇 理学
- 172 篇 数学
- 20 篇 生物学
- 6 篇 统计学（可授理学、...
- 4 篇 物理学
- 2 篇 化学
24 篇 管理学
- 19 篇 图书情报与档案管...
- 6 篇 管理科学与工程(可...
4 篇 医学
- 4 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
3 篇 法学
- 3 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学

主题

216 篇 string searching...

机构

6 篇 department of bi...
5 篇 department of co...
4 篇 computer technol...
3 篇 presto japan sci...
3 篇 department of in...
3 篇 univ chile dept ...
2 篇 institute for co...
2 篇 school of inform...
2 篇 information scie...
2 篇 department of in...
2 篇 georgia inst tec...
2 篇 information scie...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ rouen norma...
2 篇 department of in...
2 篇 department of co...
2 篇 univ liverpool d...
2 篇 courant institut...
2 篇 department of co...

作者

11 篇 fan hongbo
7 篇 breslauer dany
7 篇 faro simone
6 篇 liu lijun
6 篇 crochemore maxim...
6 篇 huang qingsong
5 篇 tarhio jorma
5 篇 agarwal suneeta
5 篇 prasad rajesh
5 篇 lecroq thierry
4 篇 yao nianmin
4 篇 peltola hannu
4 篇 takeda masayuki
4 篇 inenaga shunsuke
4 篇 iliopoulos costa...
4 篇 navarro gonzalo
4 篇 nakashima yuto
4 篇 grossi roberto
4 篇 grabowski szymon
3 篇 manea florin

语言

213 篇 英文
2 篇 中文
1 篇 其他

检索条件"主题词=String searching algorithms"

共 216 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

On improving the worst case running time of the Boyer-Moore string matching algorithm 5th

引用

5th International Colloquium on Automata, Languages and Programming, ICALP 1978

作者： Galil, Zvi Department of Mathematical Sciences Computer Science Division Tel-Aviv University Ramat-Aviv Tel-Aviv Israel

ISBN: (纸本)9783540088608

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient experimental string matching by weak factor recognition 1

引用

12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001

作者： Allauzen, Cyril Crochemore, Maxime Raffinot, Mathieu Institut Gaspard-Monge Université de Marne-la-Vallée Cité Descartes Champs-sur-Marne Marne-la-Vallée Cedex 277454 France Equipe génome cellule et informatique Université de Versailles 45 avenue des Etats-Unis Versailles Cedex78035 France

ISBN: (数字)9783540481942

ISBN: (纸本)3540422714

We introduce a new notion of weak factor recognition that is the foundation of new data structures and on-line string matching algorithms. We define a new automaton built on a string p = p1p2… pm that acts like an oracle on the set of factors pi…pj. If a string is recognized by this automaton, it may be a factor of p. But, if it is rejected, it is surely not a factor. We call it factor oracle. More precisely, this automaton is acyclic, recognizes at least the factors of p, has m+ 1 states and a linear number of transitions. We give a very simple sequential construction algorithm to build it. Using this automaton, we design an efficient experimental on-line string matching algorithm (we conjecture its optimality in regard to the experimental results) that is really simple to implement. We also extend the factor oracle to predict that a string could be a suffix (i.e. in the set pi… pm) of p. We obtain the suffix oracle, that enables in some cases a tricky improvement of the previous string matching algorithm. © Springer-Verlag Berlin Heidelberg 2001.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Crochemore's string Matching Algorithm: Simplification, Extensions, Applications

Crochemore's String Matching Algorithm: Simplification, Exte...

引用

8th Prague stringology Conference (PSC)

作者： Karkkainen, Juha Kempa, Dominik Puglisi, Simon J. Univ Helsinki Dept Comp Sci Helsinki Finland

ISBN: (纸本)9788001053300

We address the problem of string matching in the special case where the pattern is very long. First, constant extra space algorithms are desirable with long patterns, and we describe a simplified version of Crochemore's algorithm retaining its linear time complexity and constant extra space usage. Second, long patterns are unlikely to occur in the text at all. Thus we define a generalization of string matching called Longest Prefix Matching that asks for the occurrences of the longest prefix of the pattern occurring in the text at least once, and modify the simplified Crochemore's algorithm to solve this problem. Finally, we define and solve the problem of Sparse Longest Prefix Matching that is useful when the pattern has to be split into multiple pieces because it is too long to be processed in one piece. These problems are motivated by and have application in Lempel-Ziv (LZ77) factorization.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Faster string matching with super-alphabets 9th

引用

9th International Symposium on string Processing and Information Retrieval, SPIRE 2002

作者： Fredriksson, Kimmo Department of Computer Science University of Helsinki Kimmo Finland

ISBN: (纸本)3540441581

Given a text T[1… n] and a pattern P[1…m] over some alphabet Σ of size σ, finding the exact occurrences of P in T requires at least Ω(n logσ m/m) character comparisons on average, as shown in [19]. Consequently, it is believed that this lower bound implies also an Ω(n logσ m/m) lower bound for the execution time of an optimal algorithm. However, in this paper we show how to obtain an O(n/m) average time algorithm. This is achieved by slightly changing the model of computation, and with a modification of an existing algorithm. Our technique uses a super–alphabet for simulating suffix automaton. The space usage of the algorithm is O(σm). The technique can be applied to many other string matching algorithms, including dictionary matching, which is also solved in expected time O(n/m), and approximate matching allowing k edit operations (mismatches, insertions or deletions of characters). This is solved in expected time O(nk/m) for k ≤ O(m/logσ m). The known lower bound for this problem is Ω(n(k + logσ m)/m), given in [6]. Finally we show how to adopt a similar technique to the shift-or algorithm, extending its bit-parallelism in another direction. This gives a speed-up by a factor s, where s is the number of characters processed simultaneously. Some of the algorithms are implemented, and we show that the methods work well in practice too. This is especially true for the shift-or algorithm, which in some cases works faster than predicted by the theory. The result is the fastest known algorithm for exact string matching for short patterns and small alphabets. All the methods and analyses assume the ram model of computation, and that each symbol is coded in b = [log2 σ] bits. They work for larger b too, but the speed-up is decreased. © Springer-Verlag Berlin Heidelberg 2002.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Constant-space string matching with smaller number of comparisons: Sequential sampling 6th

Constant-space string matching with smaller number of compar...

引用

6th Annual Symposium on Combinatorial Pattern Matching (CPM 95)

作者： Gasieniec, L Plandowski, W Rytter, W Instytut Informatyki Uniwersytet Warszawsk Warszawa Poland

ISBN: (纸本)3540600442

A new string-matching algorithm working in constant space and linear time is presented. It is based on a powerful idea of sampling, originally introduced in parallel computations. The algorithm uses a sample S which consists of two positions inside the pattern P. First the positions of the sample S are tested against the corresponding positions of the text T, then a version of Knuth-Morris-Pratt algorithm is applied. This gives the simplest known string-matching algorithm which works in constant space and linear time and which does not use any linear order of the alphabet. A refined version of the algorithm gives the fastest (in the sense of number of comparisons) known algorithm for string-matching in constant space. It makes (1 + epsilon)n + O(n/m) symbol comparisons. This improves substantially the result of [3], where a (3/2 + epsilon)n comparisons constant space algorithm was designed. Additionally, our preprocessing to this algorithm makes only (1 + epsilon)m + O(1/epsilon) comparisons and uses constant space.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Audio fingerprint identification by approximate string matching

Audio fingerprint identification by approximate string match...

引用

8th International Conference on Music Information Retrieval, ISMIR 2007

作者： Lebosse, Jerome Brun, Luc France Telecom RandD 42 rue des coutures 14000 Caen France GREYC UMR 6072 6 boulevard du Marchal Juin 14050 Caen France

ISBN: (纸本)9783854032182

An audio fingerprint is a small digest of an audio file which allows to identify it among a database of candidates. This paper first presents a fingerprint extraction algorithm. The identification task is performed by a new identification scheme which combines string matching algorithms and q-grams filtration. ©2007 Austrian Computer Society (OCG).

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparison of two-dimensional string matching algorithms

Comparison of two-dimensional string matching algorithms

引用

2012 International Conference on Computer Science and Electronics Engineering, ICCSEE 2012

作者： Chang, Chengguo Wang, Hui Department of Information Engineering North China University of Water Resources and Electric Power Zhengzhou China

ISBN: (纸本)9780769546476

string matching is a special kind of pattern recognition problem, which finds all occurrences of a given pattern string in a given text string. The technology of two-dimensional string matching is applied broadly in many information processing domains. A good two-dimensional string matching algorithm can effectively enhance the searching speed. In this paper, the KMP algorithm, Rabin-Karp algorithm and their combinatorial are presented and compared, by a number of tests at diverse data scales, to validate the efficiency of these three algorithms. © 2012 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast string matching algorithms for very short patterns

Fast string matching algorithms for very short patterns

引用

IET International Conference on Information Science and Control Engineering 2012, ICISCE 2012

作者： Zhou, Yao Fan, Hongbo Liu, Lijun Huang, Qingsong Department of Computer Science Kunming University of Science and Technology 650500 China Computer Technology Application Key Laboratory of Yunnan Province 650500 China Department of Biomedical Engineering Kunming University of Science and Technology 650500 China

ISBN: (纸本)9781849196413

Exact single pattern string matching is a fundamental problem in computer science. To date, the performance of existing string matching algorithms for very short patterns is poor. In this article, based on the most basic exact single pattern string matching algorithm-BF, we presented a serial improved algorithms named HBF by introducing the q-grams method, the loop unrolling method, and modifying the smallest processing unit from byte to integer. Experimental results indicated that HBF is obviously faster than known algorithms for very short patterns on our platform. Meanwhile, the pre-processing phase of HBF just need constant time and space, the worst and the best time complexity are linear and 0(n/w), separately, which w is the number of characters involved in an integer.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A note on some interesting test results for the Rabin-Karp string matching algorithm 18

A note on some interesting test results for the Rabin-Karp s...

引用

18th Conference Information Technologies - Applications and Theory, ITAT 2018

作者： Jajcayová, Tatiana Majeríková, Zuzana Department of Applied Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9781727267198

While analyzing and testing some of the well known string matching algorithms, we came across rather interesting phenomenon in tests results for the Rabin-Karp algorithm. Testing which moduli work best in the algorithm, we realized that on some texts some moduli perform much worse then others. This caught our attention, and we continued testing. In this paper, we summarize tests using different moduli on the same text, tests run on different English texts (fiction, scientific, law, newspaper), and tests run on different languages and alphabets (English, Slovak, French, German and Russian). We include analysis of the obtained results and state some hypotheses. © 2018 Tatiana Jajcayová and Zuzana Majeríková.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel bloom filter string searching algorithm on a many-core processor

A parallel bloom filter string searching algorithm on a many...

引用

2013 IEEE Conference on Open Systems, ICOS 2013

作者： Ong, Wenmei Baskaran, Vishnu Monn Chong, Poh Kit Ettikan, K.K. Yong, Keh Kok Faculty of Engineering Multimedia University Cyberjaya Campus Selangor Malaysia Faculty of Engineering and Science University Tunku Abdul Rahman Petaling Jaya Selangor Malaysia Accelerative Technology Lab MIMOS Berhad Kuala Lumpur Malaysia

ISBN: (纸本)9781479902859

This paper analyzes the underlying architecture of a serial Bloom filter string searching algorithm to identify the performance impact of this algorithm for large datasets. Then, a parallel multi-core driven Bloom filter algorithm using software application threads is studied as benchmark. Experimental results suggest that for a set of 10 million strings, this algorithm exhibits speedups of up to 3.3× against a serial Bloom filter algorithm, when using an 8-logical processor multi-core architecture. To further improve the speedup, a many-core driven parallel Bloom filter algorithm is proposed using the Compute Unified Device Architecture (CUDA) parallel computing platform. The proposed algorithm segments the string list into blocks of words and threads in generating the bit table for the string searching process, which maximizes computational performance and sustains consistent string searching results. Experimental results suggest that the proposed algorithm extends the speedup to 5.5× against a serial Bloom filter algorithm, when using a 256-core CUDA graphics processing unit architecture. © 2013 IEEE.

关键词： string searching algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共22页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：