咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2005年 第3期82卷 259-274页
作者: Saha, A Pal, M Pal, TK Vidasagar Univ Dept Appl Math Oceanol & Comp Programming Midnapore 721102 W Bengal India
A spanning tree T is said to be a tree t-spanner of a graph G if the distance between any two vertices in T is at most t times their distance in G. The tree t-spanner has many applications in network and distributed e... 详细信息
来源: 评论
AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS
收藏 引用
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2005年 第1-2期19卷 77-92页
作者: Saha, Anita Pal, Madhumangal Pal, Tapan K. Vidyasagar Univ Midnapore W Bengal India Vidyasagar Univ Dept Appl Math Oceanol & Comp Programming Midnapore 721102 W Bengal India Kharagpur Coll Kharagpur W Bengal India
An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O(n(2)/log n) processors on an EREW PRAM, provided the graph has at most O(n... 详细信息
来源: 评论
Optimal discovery of repetitions in 2D
收藏 引用
DISCRETE APPLIED MATHEMATICS 2005年 第1-3期151卷 5-20页
作者: 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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Extracting approximate patterns
收藏 引用
JOURNAL OF DISCRETE algorithms 2005年 第2-4期3卷 293-320页
作者: Pelfrene, Johann Abdeddaim, Said Alexandre, Joel ExonHit Therapeut 65 Blvd Massena F-75103 Paris France Univ Rouen ABISS UMR 6037 F-76821 Mont St Aignan France Univ Rouen ABISS LIFAR F-76821 Mont St Aignan France
In this paper, we define a family of patterns with don't cares occurring in a text. We call them primitive patterns. The set of primitive patterns forms a basis for all the maximal patterns occurring in the text. ... 详细信息
来源: 评论
Two-dimensional pattern matching with rotations
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第1-2期314卷 173-187页
作者: Amir, A Butman, A Crochemore, M Landau, GM Schaps, M Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Univ Marne La Vallee Inst Gaspard Monge London England Kings Coll London London WC2R 2LS England Univ Haifa Dept Comp Sci IL-31905 Haifa Israel Polytech Univ Dept Comp & Informat Sci MetroTech Ctr 6 Brooklyn NY 11201 USA Bar Ilan Univ Dept Math IL-52900 Ramat Gan Israel
The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different pos... 详细信息
来源: 评论
Faster algorithms for string matching with k mismatches
收藏 引用
JOURNAL OF algorithms-COGNITION INFORMATICS AND LOGIC 2004年 第2期50卷 257-275页
作者: Amir, A Lewenstein, M Porat, E Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel Georgia Inst Technol Coll Comp Atlanta GA 30332 USA
The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length in and every length in substring of the text T. Currently, the fastest algorithms for this problem ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Faster algorithms for string matching with k mismatches
Faster algorithms for string matching with <i>k</i> mismatch...
收藏 引用
11th Annual ACM/SIAM Symposium on Discrete algorithms
作者: Amir, A Lewenstein, M Porat, E Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel Georgia Inst Technol Coll Comp Atlanta GA 30332 USA
The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length in and every length in substring of the text T. Currently, the fastest algorithms for this problem ... 详细信息
来源: 评论
Overlap matching
收藏 引用
INFORMATION AND COMPUTATION 2003年 第1期181卷 57-74页
作者: Amir, A Cole, R Hariharan, R Lewenstein, M Porat, E IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Georgia Tech Coll Comp Atlanta GA 30332 USA NYU Courant Inst Math Sci Dept Comp Sci New York NY 10012 USA Indian Inst Sci CSA Dept Bangalore 560012 Karnataka India
We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are si... 详细信息
来源: 评论