咨询与建议

限定检索结果

文献类型

  • 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
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... 详细信息
来源: 评论
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
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 or... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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
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-directe... 详细信息
来源: 评论
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
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... 详细信息
来源: 评论
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
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 th... 详细信息
来源: 评论
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
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... 详细信息
来源: 评论
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
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 rep... 详细信息
来源: 评论
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
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 ... 详细信息
来源: 评论
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
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... 详细信息
来源: 评论