咨询与建议

限定检索结果

文献类型

  • 41 篇 期刊文献
  • 7 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 37 篇 工学
    • 31 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 5 篇 软件工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 信息与通信工程
  • 27 篇 理学
    • 26 篇 数学
    • 5 篇 统计学(可授理学、...
    • 1 篇 物理学
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...

主题

  • 48 篇 average complexi...
  • 4 篇 analysis of algo...
  • 3 篇 finite automata
  • 2 篇 markov chains
  • 2 篇 generic complexi...
  • 2 篇 algorithms
  • 2 篇 pattern matching
  • 2 篇 brownian motion
  • 2 篇 computational ge...
  • 2 篇 linear programmi...
  • 2 篇 parameters of in...
  • 2 篇 interchanges
  • 2 篇 global optimizat...
  • 2 篇 convex hull
  • 2 篇 probabilistic an...
  • 2 篇 graph coloring
  • 2 篇 lower bounds
  • 1 篇 backtracking alg...
  • 1 篇 distributed arch...
  • 1 篇 random search

机构

  • 1 篇 univ politecn ca...
  • 1 篇 ecole polytechn ...
  • 1 篇 univ lyon 1 cnrs...
  • 1 篇 univ chicago dep...
  • 1 篇 ajou univ sch ie...
  • 1 篇 aix marseille un...
  • 1 篇 inria cachan
  • 1 篇 department of ma...
  • 1 篇 univ caen f-1403...
  • 1 篇 ecole normale su...
  • 1 篇 shanghai jiao to...
  • 1 篇 univ lubeck inst...
  • 1 篇 chinese acad sci...
  • 1 篇 tel aviv univ ra...
  • 1 篇 katholieke univ ...
  • 1 篇 univ maryland de...
  • 1 篇 univ. of souther...
  • 1 篇 cnrs cachan
  • 1 篇 univ paris 13 cn...
  • 1 篇 inria paris

作者

  • 3 篇 david julien
  • 3 篇 nicaud cyril
  • 2 篇 chakraborty soub...
  • 2 篇 didier gilles
  • 2 篇 feuilloley laure...
  • 1 篇 lhote loick
  • 1 篇 miguel pardo lui...
  • 1 篇 tonelli-cueto jo...
  • 1 篇 beltran carlos
  • 1 篇 carayol arnaud
  • 1 篇 denise alain
  • 1 篇 avanzini martin
  • 1 篇 yang jun
  • 1 篇 moser georg
  • 1 篇 lauria massimo
  • 1 篇 sourabh suman ku...
  • 1 篇 diaz j
  • 1 篇 xu k
  • 1 篇 yang feiran
  • 1 篇 mcdiarmid cjh

语言

  • 42 篇 英文
  • 6 篇 其他
检索条件"主题词=Average complexity"
48 条 记 录,以下是21-30 订阅
排序:
Replacement sort revisited: The "gold standard" unearthed!
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2007年 第1期189卷 384-394页
作者: Chakraborty, Soubhik Sourabh, Suman Kumar Bose, Mausumi Sushant, Kumar Bhagalpur Univ Univ Dept Stat & Comp Appl Bhagalpur 812007 India Indian Stat Inst Appl Stat Unit Kolkata 700108 India BIT Mesra Dept Appl Phys Ranchi 835215 Bihar India
The present paper shows that for certain algorithms such as sorting, the parameters of the input distribution must also be taken into account, apart from the input size, for a more precise evaluation of computational ... 详细信息
来源: 评论
average complexity of Addition Updates and Range Queries over an Array using Graphs
收藏 引用
Electronic Notes in Discrete Mathematics 2003年 13卷 117-122页
作者: Toni, A. Facultad de Informatica Universidad Politecnica de Madrid Spain
来源: 评论
A one-pass VBR video coding in fix size
A one-pass VBR video coding in fix size
收藏 引用
International Symposium on Communications and Information Technologies (ISCIT 2004)
作者: Hou, J Fang, XZ Hou, R Shanghai Jiao Tong Univ Inst Image Commun & Informat Proc Shanghai 200030 Peoples R China
This paper proposes a lowly complex one-pass variable bit rate video coding algorithm, which gets smooth quality and satisfies constraint of constant storage size. According to the correlation among frames, it uses lo... 详细信息
来源: 评论
Extreme points under random noise
收藏 引用
12th Annual European Symposium on Algorithms (ESA 2004)
作者: Damerow, V Sohler, C Univ Paderborn Dept Comp Sci Heinz Nixdorf Inst D-33102 Paderborn Germany
Given a point set P = {p(1),...,p(n)} in the d-dimensional unit hypercube, we give upper bounds on the maximal expected number of extreme points when each point pi is perturbed by small random noise chosen independent... 详细信息
来源: 评论
complexity information based analysis of pathological ECG rhythm for ventricular tachycardia and ventricular fibrillation
收藏 引用
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS 2002年 第10期12卷 2293-2303页
作者: Zhang, HX Zhu, YS Xu, YH Shanghai Jiao Tong Univ Dept Biomed Engn Shanghai 200030 Peoples R China
Based on surrogate data hypothesis testing method, this paper presents an improved nonlinear algorithm for analyzing deterministic chaotic signals, which can be applied to the analysis of abnormal rhythm electrocardio... 详细信息
来源: 评论
Deciding k-colorability in expected polynomial time
收藏 引用
INFORMATION PROCESSING LETTERS 2002年 第1期81卷 1-6页
作者: Krivelevich, M Tel Aviv Univ Raymond & Beverly Sackler Fac Exact Sci Dept Math IL-69978 Tel Aviv Israel
For every fixed k greater than or equal to 3 we describe an algorithm for deciding k-colorability, whose expected running time in polynomial in the probability space G(n, p) of random graphs as long as the edge probab... 详细信息
来源: 评论
The extended Euclidian algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems
收藏 引用
DESIGNS CODES AND CRYPTOGRAPHY 2001年 第1期23卷 53-74页
作者: Enge, A Univ Augsburg Lehrstuhl Diskrete Math Optimierung & Operat Res D-86135 Augsburg Germany
After generalising two reduction algorithms to characteristic 2, we analyse the average complexity of the arithmetic in hyperelliptic Jacobians over any finite field. To this purpose we determine the exact average num... 详细信息
来源: 评论
An average analysis of backtracking on random constraint satisfaction problems
收藏 引用
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2001年 第1期33卷 21-37页
作者: Xu, K Li, W Beijing Univ Aeronaut & Astronaut Dept Comp Sci & Engn Natl Lab Software Dev Environm Beijing 100083 Peoples R China
In this paper we propose a random CSP model, called Model GB, which is a natural generalization of standard Model B. This paper considers Model GB in the case where each constraint is easy to satisfy. In this case Mod... 详细信息
来源: 评论
On the average-case complexity of the graph reliability problem on Gaussian distributions
收藏 引用
Fundamenta Informaticae 1998年 第4期36卷 307-315页
作者: Burago, Dmitri de Rougemont, Michel Department of Mathematics Penn-State University University Park U.S.A. email address : burago@math.psu.edu Department of Computer Science University Paris II Paris France. email address : mdr@lri.fr
We introduce classes of narrow graphs (including grid strips of fixed width), for which the graph reliability problem admits a polynomial time algorithm. Using this algorithm, we show that graph reliability is computa... 详细信息
来源: 评论
Malign distributions for average case circuit complexity
收藏 引用
INFORMATION AND COMPUTATION 1999年 第2期150卷 187-208页
作者: Jakoby, A Reischuk, R Schindelhauer, C Univ Lubeck Inst Theoret Informat D-23560 Lubeck Germany
In contrast to machine models like Turing machines or random access machines, circuits are a static computational model. The internal information flow of a computation is fixed in advance, independent of the actual in... 详细信息
来源: 评论