咨询与建议

限定检索结果

文献类型

  • 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
收藏 引用
JOURNAL OF algorithms-COGNITION INFORMATICS AND LOGIC 2000年 第2期37卷 247-266页
作者: Amir, A Aumann, Y Landau, GM Lewenstein, M Lewenstein, N Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel Georgia Inst Technol Atlanta GA 30332 USA Polytech Univ MetroTech Ctr 6 Dept Comp & Informat Sci Brooklyn NY 11201 USA Univ Haifa Dept Comp Sci IL-31905 Haifa Israel
Let a text string T of n symbols and a pattern string P of m symbols from alphabet Sigma be given. A swapped version T' of T is a length n string derived from T by a series of local swaps (i.e., t(l)' <-- t... 详细信息
来源: 评论
Pattern matching in hypertext
收藏 引用
JOURNAL OF algorithms-COGNITION INFORMATICS AND LOGIC 2000年 第1期35卷 82-99页
作者: Amir, A Lewenstein, M Lewenstein, N Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel
The importance of hypertext has been steadily growing over the past decade. The Internet and other information systems use hypertext formal, with data organized associatively rather than sequentially or relationally. ... 详细信息
来源: 评论
Approximate swapped matching  20th
收藏 引用
20th Conference on Foundations of Software Technology and Theoretical Computer Science
作者: Amir, A Lewenstein, M Porat, E Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel Bar Ilan Univ Dept Math & Comp Sci IL-52900 Ramat Gan Israel
Let a text string T of n symbols and a pattern string P of rn symbols from alphabet Sigma be given. A swapped version P' of P is a length m string derived from P by a series of local swaps, (i.e. p'(l) <-- ... 详细信息
来源: 评论
Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第5期28卷 1906-1922页
作者: Kaplan, H Shamir, R Tarjan, RE AT&T Labs Res Florham Pk NJ 07932 USA Tel Aviv Univ Sackler Fac Exact Sci Dept Comp Sci IL-69978 Tel Aviv Israel Princeton Univ Dept Comp Sci Princeton NJ 08544 USA
We study the parameterized complexity of three NP-hard graph completion problems. The minimum fill-in problem asks if a graph can be triangulated by adding at most k edges. We develop O(c(k)m) and O(k(2)mn + f(k)) alg... 详细信息
来源: 评论
An efficient algorithm to generate all maximal independent sets on trapezoid graphs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1999年 第4期70卷 587-599页
作者: Hota, M Pal, M Pal, TK Vidyasagar Univ Dept Appl Math Oceanol & Comp Programming Midnapore 721102 India Midnapore Coll Dept Math Midnapore 721101 India
Generation of all maximal independent sets (MIS) is a NP-complete problem for general graphs. In this paper, using a particular geometric property of trapezoid graph, an efficient algorithm is designed which enables t... 详细信息
来源: 评论
Bounded degree interval sandwich problems
收藏 引用
ALGORITHMICA 1999年 第2期24卷 96-104页
作者: Kaplan, H Shamir, R AT&T Bell Labs Res Florham Park NJ 07932 USA Tel Aviv Univ Sackler Fac Exact Sci Dept Comp Sci IL-69978 Tel Aviv Israel
The problems of Interval Sandwich (IS)and Intervalizing Colored Graphs' (ICG) have received a lot of attention recently, due to their applicability to DNA physical mapping problems with ambiguous data. Most of the... 详细信息
来源: 评论
The complexity of certain incremental code generation problems
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1999年 第4期71卷 447-458页
作者: Venugopal, R Srikant, YN Indian Inst Sci Dept Comp Sci & Automat Bangalore 560012 Karnataka India
This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Le... 详细信息
来源: 评论
A Computational Study of Routing algorithms for Realistic Transportation Networks
收藏 引用
ACM Journal of Experimental Algorithmics 1999年 4卷 6-6页
作者: Jacob, Riko Marathe, Madhav Nagel, Kai RRTCS Department of Computer Science University of Aarhus DK-8000 Århus C Ny Munkegade Bldg. 540 Denmark Los Alamos National Laboratory MS M997 Los Alamos NM 87545 P.O. Box 1663 United States
We carry out an experimental analysis of a number of shortest-path (routing) algorithms investigated in the context of the TRANSIMS (TRansportation analysis and SIMulation System) project. The main focus of the paper ... 详细信息
来源: 评论
On minimum-area hulls
收藏 引用
ALGORITHMICA 1998年 第1期21卷 119-136页
作者: Arkin, EM Chiang, YJ Held, M Mitchell, JSB Sacristan, V Skiena, SS Yang, TC SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA Salzburg Univ Inst Comp Wissensch A-5020 Salzburg Austria Univ Politecn Catalunya Dept Matemat Applicada 2 E-08028 Barcelona Spain SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA Kyungsung Univ Dept Comp Sci & Stat Nam Gu Pusan 608736 South Korea
We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygo... 详细信息
来源: 评论
A parallel algorithm to generate all maximal independent sets on permutation graphs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1998年 第3-4期67卷 261-274页
作者: Pal, M Indian Inst Technol Dept Math Kharagpur 721302 W Bengal India
In this paper, an O(log n) time and O(nn'/log n) processors parallel algorithm is designed to generate all paths from leaf nodes to the root of a tree, where n' is the total number of such paths. Using this al... 详细信息
来源: 评论