咨询与建议

限定检索结果

文献类型

  • 321 篇 期刊文献
  • 14 篇 会议

馆藏范围

  • 335 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 305 篇 工学
    • 302 篇 计算机科学与技术...
    • 9 篇 软件工程
    • 6 篇 电气工程
    • 6 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 2 篇 电子科学与技术(可...
    • 1 篇 建筑学
    • 1 篇 城乡规划学
  • 45 篇 理学
    • 41 篇 数学
    • 3 篇 物理学
    • 1 篇 地理学
    • 1 篇 统计学(可授理学、...
  • 11 篇 管理学
    • 8 篇 管理科学与工程(可...
    • 3 篇 图书情报与档案管...
    • 2 篇 工商管理
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 医学
    • 1 篇 特种医学

主题

  • 335 篇 design of algori...
  • 80 篇 analysis of algo...
  • 47 篇 combinatorial pr...
  • 31 篇 parallel algorit...
  • 29 篇 algorithms
  • 24 篇 graph algorithms
  • 24 篇 data structures
  • 18 篇 computational co...
  • 16 篇 dynamic programm...
  • 13 篇 computational ge...
  • 11 篇 approximation al...
  • 11 篇 randomized algor...
  • 10 篇 interval graph
  • 8 篇 string matching
  • 8 篇 online algorithm...
  • 7 篇 longest common s...
  • 7 篇 pattern matching
  • 6 篇 binary tree
  • 6 篇 rotation distanc...
  • 6 篇 interval graphs

机构

  • 11 篇 vidyasagar univ ...
  • 7 篇 natl sun yat sen...
  • 5 篇 bar ilan univ de...
  • 3 篇 calif state univ...
  • 3 篇 narajole raj col...
  • 3 篇 univ jena fak ma...
  • 3 篇 univ pisa dipart...
  • 3 篇 sejong univ dept...
  • 3 篇 ys palpara mahav...
  • 3 篇 univ texas dept ...
  • 2 篇 univ roma tor ve...
  • 2 篇 hanyang univ div...
  • 2 篇 sutcu imam univ ...
  • 2 篇 univ pisa dipart...
  • 2 篇 natl inst techno...
  • 2 篇 univ luxembourg ...
  • 2 篇 department of ap...
  • 2 篇 maastricht univ ...
  • 2 篇 univ nevada dept...
  • 2 篇 univ nevada sch ...

作者

  • 11 篇 pal madhumangal
  • 7 篇 yang chang-biau
  • 7 篇 pal m
  • 6 篇 mondal sukumar
  • 6 篇 pagli linda
  • 6 篇 ann hsing-yen
  • 6 篇 luccio fabrizio
  • 5 篇 barman sambhu ch...
  • 4 篇 pal anita
  • 4 篇 tang cy
  • 4 篇 tseng chiou-ting
  • 4 篇 pal tk
  • 4 篇 rana akul
  • 4 篇 shen xj
  • 4 篇 peng yung-hsing
  • 4 篇 lecroq thierry
  • 4 篇 han yj
  • 4 篇 landau gm
  • 4 篇 luccio f
  • 3 篇 bein wolfgang

语言

  • 318 篇 英文
  • 17 篇 其他
检索条件"主题词=Design of algorithms"
335 条 记 录,以下是31-40 订阅
Trackless online algorithms for the server problem
收藏 引用
INFORMATION PROCESSING LETTERS 2000年 第1-2期74卷 73-79页
作者: Bein, WW Larmore, LL Univ Nevada Dept Comp Sci Las Vegas NV 89154 USA
A class of "simple" online algorithms for the k-server problem is identified. This class, for which the term trackless is introduced, includes many known server algorithms. The k-server conjecture fails for ... 详细信息
来源: 评论
An optimal linear time algorithm for quasi-monotonic segmentation
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2009年 第7期86卷 1093-1104页
作者: Lemire, Daniel Brooks, Martin Yan, Yuhong Univ Quebec Montreal PQ H3C 3P8 Canada Natl Res Council Canada Ottawa ON Canada
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting a sequence in up to K segments. We want the segments to be as monotonic as possible and to alternate signs. We... 详细信息
来源: 评论
Hybrid string matching algorithm with a pivot
收藏 引用
JOURNAL OF INFORMATION SCIENCE 2015年 第1期41卷 82-88页
作者: Al-Ssulami, Abdulrakeeb M. King Saud Univ Riyadh 11543 Saudi Arabia
Pattern matching is important in text processing, molecular biology, operating systems and web search engines. Many algorithms have been developed to search for a specific pattern in a text, but the need for an effici... 详细信息
来源: 评论
THE ALL-PAIRS QUICKEST PATH PROBLEM
收藏 引用
INFORMATION PROCESSING LETTERS 1993年 第5期45卷 261-267页
作者: LEE, DT PAPADOPOULOU, E Department of Electrical Engineering and Computer Science Northwestern University Evanston IL 60208 USA
Given nodes s and t, the quickest path problem is to find a path p from s to t, such that the total transmission time in the communication network for sigma units of data, with sigma greater than or equal to zero, fro... 详细信息
来源: 评论
Should one always use repeated squaring for modular exponentiation?
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第6期106卷 232-237页
作者: Klein, Shmuel T. Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel
Modular exponentiation is a frequent task, in particular for many cryptographic applications. To accelerate modular exponentiation for very large integers one may use repeated squaring. which is based on representing ... 详细信息
来源: 评论
The symmetry number problem for trees
收藏 引用
INFORMATION PROCESSING LETTERS 2001年 第2期79卷 73-79页
作者: Chin, KW Yen, HC Natl Taiwan Univ Dept Elect Engn Taipei 10764 Taiwan
For trees, we define the notion of the so-called symmetry number to measure the size of the maximum subtree that exhibits an axial symmetry in graph drawing. For unrooted unordered trees, we are able to demonstrate a ... 详细信息
来源: 评论
SPLITSORT - AN ADAPTIVE SORTING ALGORITHM
收藏 引用
INFORMATION PROCESSING LETTERS 1991年 第4期39卷 205-211页
作者: LEVCOPOULOS, C PETERSSON, O Department of Computer Science Lund University Box 118 S-22100 Lund Sweden
We present a new sorting algorithm, called Splitsort, which adapts to existing order within the input sequence. The algorithm is optimal with respect to several known measures of presortedness, including the number of... 详细信息
来源: 评论
SCHEDULING ON A HYPERCUBE
收藏 引用
INFORMATION PROCESSING LETTERS 1991年 第6期40卷 323-328页
作者: SHEN, XJ REINGOLD, EM UNIV ILLINOIS DEPT COMP SCIURBANAIL 61801
We present a THETA(n2) worst-case-time algorithm to determine the minimum finishing time for a preemptive schedule of n independent jobs on a hypercube of fixed dimension.
来源: 评论
Combinatorial algorithm for MAX CSP
收藏 引用
INFORMATION PROCESSING LETTERS 2003年 第6期85卷 307-315页
作者: Datar, M Feder, T Gionis, A Motwani, R Panigrahy, R Stanford Univ Dept Comp Sci Stanford CA 94305 USA
We consider the problem MAX CSP over multi-valued domains with variables ranging over sets of size s(i) less than or equal to s and constraints involving k(j) less than or equal to k variables. We study two algorithms... 详细信息
来源: 评论
Dynamics of a mean-shift-like algorithm and its applications on clustering
收藏 引用
INFORMATION PROCESSING LETTERS 2013年 第1-2期113卷 8-16页
作者: Liu, Yiguang Li, Stan Z. Wu, Wei Huang, Ronggang Sichuan Univ Vis & Image Proc Lab Sch Comp Chengdu 610064 Sichuan Provinc Peoples R China Chinese Acad Sci CBSR Inst Automat Beijing 100080 Peoples R China Chinese Acad Sci NLPR Inst Automat Beijing 100080 Peoples R China Sichuan Univ Sch Elect & Informat Engn Chengdu 610064 Sichuan Provinc Peoples R China
The Mean-Shift (MS) algorithm and its variants have wide applications in pattern recognition and computer vision tasks such as clustering, segmentation, and tracking. In this paper, we study the dynamics of the algori... 详细信息
来源: 评论