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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

100 篇 期刊文献
28 篇 会议

馆藏范围

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

日期分布

学科分类号

95 篇 工学
- 91 篇 计算机科学与技术...
- 16 篇 软件工程
- 11 篇 电气工程
- 6 篇 电子科学与技术（可...
- 4 篇 信息与通信工程
- 1 篇 仪器科学与技术
- 1 篇 生物工程
- 1 篇 网络空间安全
65 篇 理学
- 63 篇 数学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 生物学
8 篇 管理学
- 8 篇 管理科学与工程(可...
- 1 篇 工商管理
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 临床医学

主题

128 篇 design and analy...
19 篇 pattern matching
14 篇 combinatorial al...
8 篇 approximation al...
7 篇 parallel algorit...
6 篇 pattern discover...
6 篇 computational ge...
6 篇 pattern matching...
6 篇 nonstandard patt...
5 篇 dynamic programm...
4 篇 string matching
4 篇 interval graphs
4 篇 intersection gra...
4 篇 permutation grap...
3 篇 irredundant moti...
3 篇 theory of comput...
3 篇 graph algorithms
3 篇 hamming distance
3 篇 subtree isomorph...
3 篇 algorithms

机构

8 篇 bar ilan univ de...
5 篇 bar ilan univ de...
5 篇 natl cheng kung ...
5 篇 toyohashi univ t...
4 篇 georgia inst tec...
4 篇 georgia inst tec...
4 篇 georgia inst tec...
4 篇 kushiro natl col...
3 篇 tel aviv univ sa...
3 篇 vidyasagar univ ...
3 篇 univ haifa dept ...
3 篇 natl cheng kung ...
3 篇 ibm corp thomas ...
3 篇 kushiro natl col...
3 篇 purdue univ dept...
2 篇 vidyasagar univ ...
2 篇 univ tsukuba dep...
2 篇 univ padua dipar...
2 篇 tech univ catalo...
2 篇 univ salerno dip...

作者

9 篇 lewenstein m
8 篇 amir a
8 篇 hsieh sun-yuan
8 篇 apostolico alber...
7 篇 faro simone
6 篇 apostolico a
6 篇 pal madhumangal
5 篇 masuyama shigeru
5 篇 cantone domenico
5 篇 porat e
5 篇 honma hirotoshi
4 篇 nakajima yoko
4 篇 pal m
4 篇 amir amihood
3 篇 kaplan h
3 篇 giaquinta emanue...
3 篇 shamir r
3 篇 tagliacollo clau...
3 篇 porat ely
3 篇 landau gm

语言

109 篇 英文
19 篇 其他

检索条件"主题词=Design and Analysis of Algorithms"

共 128 条记录，以下是101-110 订阅

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

详细简洁

排序：

Pattern Matching with Swaps for Short Patterns in Linear Time

Pattern Matching with Swaps for Short Patterns in Linear Tim...

引用

35th Conference on Current Trends in Theory and Practice of Computer Science

作者： Cantone, Domenico Faro, Sinione Univ Catania Dipartimento Matemat & Informat I-95125 Catania Italy

ISBN: (纸本)9783540958901

The Pattern Matching problem with Swaps consists in finding all occurrences of a, pattern P in a text T, when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location with a swapped match of P, the number of swaps necessary to obtain a match at the location. In this paper, we present a new approach for solving both the Swap Matching problem and the Approximate Swap Matching problem in linear time, in the case of short, patterns. In particular, we devise a O(nm) general algorithm, named CROSS-SAMPLINGING, and show an efficient implementation of it, based on bit-parallelism, which achieves O(n) worst-case time and O(sigma)-space complexity, with patterns whose length is comparable to the word-size of the target machine.

关键词： pattern matching with swaps nonstandard pattern matching combinatorial algorithms on words design and analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient bottom-up distance between trees 8

An efficient bottom-up distance between trees

引用

8th International Symposium on String Processing and Information Retrieval

作者： Valiente, G Tech Univ Catalonia Dept Software E-08034 Barcelona Spain

ISBN: (纸本)0769511937

A new bottom-up distance measure for labeled trees, which is based on the largest common forest of the trees and has the threefold advantage of independence of particular edit costs, low complexity, and coverage of ordered and unordered trees, is introduced and related in this paper with other distance measures published in the literature. algorithms for computing the bottom-up distance in time linear in the number of nodes are given in full detail.

关键词： design and analysis of algorithms combinatorial problems graph algorithms pattern matching tree pattern matching tree isomorphism subtree isomorphism edit distance metric space largest common forest

来源：评论

学校读者我要写书评

暂无评论

Optimal discovery of repetitions in 2D

Optimal discovery of repetitions in 2D

引用

9th International Workshop on Combinatorial Image analysis

作者： Apostolico, A Brimkov, VE Univ Padua Dipartimento Ingn Informat I-35131 Padua Italy Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA SUNY Coll Buffalo Dept Math Buffalo NY 14222 USA

Repetitive substructures in two-dimensional arrays emerge in speeding up searches and have been recently studied also independently in an attempt to parallel some of the classical derivations concerning repetitions in strings. The present paper focuses on repetitions in two dimensions that manifest themselves in form of two "tandem" occurrences of a same primitive rectangular pattern W where the two replicas touch each other with either one side or corner. Being primitive here means that W cannot be expressed in turn by repeated tiling of another array. The main result of the paper is an O(n(3) log n) algorithm for detecting all "side-sharing" repetitions in an n x n array. This is optimal, based on bounds on the number of such repetitions established in previous work. With easy adaptations, these constructions lead to an equally optimal, O(n(4)) algorithm for repetitions of the second type. (c) 2005 Elsevier B.V. All rights reserved.

关键词： design and analysis of algorithms pattern matching pattern discovery 2D arrays tandem repetition

来源：评论

学校读者我要写书评

暂无评论

Force-Directed Graph Layouts by Edge Sampling 9

Force-Directed Graph Layouts by Edge Sampling

引用

9th IEEE Symposium on Large Data analysis and Visualization (LDAV)

作者： Gove, Robert Two Six Labs Arlington VA 22203 USA

ISBN: (纸本)9781728126050

Recent work shows that sampling algorithms can be an effective tool for graph visualization. This paper extends prior work by applying edge sampling algorithms to speed up the spring force calculation in force-directed graph layout algorithms. An experiment on 72 graphs finds that some sampling algorithms achieve comparable quality as no sampling. This result is confirmed with visualizations of the graph layout results. However, runtime improvements are small, especially for graphs with 10,000 vertices or fewer, indicating that the runtime savings might not be worth the risk to layout quality. Therefore, this paper suggests that accurate spring forces may be more important to force-directed graph layout algorithms than accurate electric forces. A copy of this paper plus the code and data to reproduce the results are available at https://***/4ja29/

关键词： Human-centered computing Visualization Visualization techniques Graph drawings Theory of computtion design and analysis of algorithms Streaming, sublinear and near linear time algorithms Sketching and sampling

来源：评论

学校读者我要写书评

暂无评论

Management of Blood Component Preparation

Management of Blood Component Preparation

引用

IEEE International Conference on System, Man, and Cybernetic

作者： Lin, Chun-Cheng Yu, Chang-Sung Chang, Yin-Yih Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Natl Taiwan Univ Dept Business Adm Taipei Taiwan Fu Jen Catholic Univ Dept Informat Management Taipei Taiwan

ISBN: (纸本)9781424423835

In transfusion medicine, the process of preparing or separating blood components from the whole blood is essential because the indication for the use of unfractionated whole blood almost does not exist nowadays. Since blood is uneasily-collected and easily-perished, a blood center or a hospital blood bank might as well aggressively manage the volume of each blood component. so as to decrease any waste. We assume that the process of blood component preparation can be underlaid by a so-called blood component tree, where each vertex representing a blood component with a certain value is derived from its parent vertex. Initially given a certain amount of the root blood component in a blood component tree (noticing that the amount of every other blood component is zero initially), the blood component preparation problem is concerned with finding the assignment of amount of each blood component such that the total value is maximized while satisfying the demand limit of every blood component. In this paper, we propose a linear time algorithm (in the size of vertices) for efficiently coping with the concerned problem, which also can be modeled as a linear program. Some theoretical analyses are included in this paper.

关键词： dynamic programming design and analysis of algorithms blood component preparation

来源：评论

学校读者我要写书评

暂无评论

Ring Segmented and Block analysis Based Multi-feature Evaluation Model for Contrast Balancing 2nd

Ring Segmented and Block Analysis Based Multi-feature Evalua...

引用

2nd International Conference on Information, Communication and Computing Technology (ICICCT)

作者： Juneja, Kapil Maharshi Dayanand Univ Dept Comp Sci & Engn Univ Inst Engn & Technol Rohtak 124001 Haryana India

ISBN: (纸本)9789811065446;9789811065439

Image capturing in different indoor and outdoor environment requires high quality and sensing camera devices. Image capture in fog, night, rainy atmosphere, etc., can face an unequal contrast problem. Visibility is the primary concern for any image processing application to extract the content information and features accurately. In this paper, a ring segment based block feature evaluation method is provided to setup the enhancement individually in each segmented region. In this model, an intelligent method is applied to raw image to locate the regions with extreme visibility difference. The ring specific geographical mapping is applied to locate these regions. Three blocks from the region are evaluated based on visibility, entropy and frequency parameters. The comparative evaluation on block content strength is applied to get the referenced block blocks with maximum containment. Finally, each region block is mapped to this reference block to stabilize the contrast unbalancing. The proposed method is applied in real time captured images with different lighting effects. The comparative evaluation against histogram equalization method is applied for the PSNR and MSE parameters. The evaluation results show that the proposed method enhanced the visible quality and error robustness of dark, dull and faded images.

关键词： Image representations Appearance and texture representations Feature selection Image processing Visibility Image manipulation design and analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal offline extraction of irredundant motif bases

引用

13th Annual International Conference on Computing and Combinatorics (COCOON 2007)

作者： Apostolico, Alberto Tagliacollo, Claudia Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9783540735441

The problem of extracting a basis of irredundant motifs from a sequence is considered. In previous work such bases were built incrementally for all suffixes of the input string s in O(n(3)), where n is the length of s. Faster, non-incremental algorithms have been based on the landmark approach to string searching due to Fischer and Paterson, and exhibit respective time bounds of O(n(2) logn log|Sigma|) and O(|Sigma|n(2) log(2) n log log n), with Z denoting the alphabet. The algorithm by Fischer and Paterson makes crucial use of the FFT, which is impractical with long sequences. The algorithm presented in the present paper does not need to resort to the FFT and yet is asymptotically faster than previously available ones. Specifically, an off-line algorithm is presented taking time O(|Sigma|n(2)), which is optimal for finite Z.

关键词： design and analysis of algorithms pattern matching motif discovery irredundant motif basis

来源：评论

学校读者我要写书评

暂无评论

On the algorithm of Berztiss for tree pattern matching

On the algorithm of Berztiss for tree pattern matching

引用

5th Mexican International Conference in Computer Science (ENC 2004)

作者： Valiente, G Tech Univ Catalonia Dept Software E-08034 Barcelona Spain

ISBN: (纸本)0769521606

The tree pattern matching problem over labeled trees is addressed in this paper Several tree pattern matching algorithms are known which are based on the decomposition of the pattern into strings, with each string representing a root-to-leaf path. Among these, Alfs T. Berztiss gave a simple tree pattern matching algorithm which remained unknown to the research community. In this paper the tree pattern matching algorithm of Berztiss is reviewed, its correctness is established, and its complexity is shown to be O(mn) time and space in the worst case and O(n) on the average, where n is the text size and m is the pattern size.

关键词： design and analysis of algorithms combinatorial problems tree pattern matching subtree isomorphism

来源：评论

学校读者我要写书评

暂无评论

Linear time algorithms on chordal bipartite and strongly chordal graphs

引用

29th International Colloquium on Automata, Languages and Programming

作者： Uehara, R Komazawa Univ Fac Nat Sci Tokyo Japan

ISBN: (纸本)3540438645

Chordal bipartite graphs axe introduced to analyze non-symmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering of the bipartite adjacency matrix. However, the best known algorithm for computing the ordering runs in O(min{m log n,n(2)}), which is the bottleneck of the problems. We show a linear time algorithm that computes the ordering of a given chordal bipartite graph. The result improves the upper bounds of several problems, including recognition problem, from O(min{m log n, n(2)}) to linear time. Strongly chordal graphs are well-studied subclass of chordal graphs, and that have similar characterization. The upper bounds of several problems on a given strongly chordal graph are also improved from O(min {m log n, n(2)}) to linear time.

关键词： chordal bipartite graphs design and analysis of algorithms lexicographic breadth first search vertex elimination ordering strongly chordal graphs

来源：评论

学校读者我要写书评

暂无评论

A New Algorithm for Efficient Pattern Matching with Swaps

A New Algorithm for Efficient Pattern Matching with Swaps

引用

20th International Workshop on Combinatorial algorithms (IWOCA)

作者： Campanelli, Matteo Cantone, Domenico Faro, Simone Univ Catania Scuola Super Catania Via San Nullo 5-I I-95123 Catania Italy Univ Catania Dipt Matemat Informat I-95124 Catania Italy

ISBN: (纸本)9783642102165

The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text;T, when disjoint local swaps in the pattern are allowed. In this paper, we present a new efficient algorithm for the Swap Matching problem with short patterns. In particular, we devise a O(nm(2)) general algorithm, named BACKWARD-CROSS-SAMPLING, and show an efficient implementation of it, based on bit-parallelism, which achieves O(nm) worst-case time and O(sigma)-space complexity, with patterns whose length m is comparable to the word-size of the target machine (n and sigma are respectively the size of the text and of the alphabet). From an extensive comparison with some of the most recent and effective algorithms for the swap matching problem, it turns out that our algorithm is very flexible and achieves very good results in practice.

关键词： pattern matching with swaps nonstandard pattern matching combinatorial algorithms on words design and analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：