咨询与建议

限定检索结果

文献类型

  • 206 篇 期刊文献
  • 84 篇 会议
  • 2 篇 学位论文
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 192 篇 工学
    • 137 篇 计算机科学与技术...
    • 35 篇 电气工程
    • 24 篇 软件工程
    • 18 篇 控制科学与工程
    • 17 篇 信息与通信工程
    • 7 篇 机械工程
    • 6 篇 仪器科学与技术
    • 6 篇 电子科学与技术(可...
    • 5 篇 生物医学工程(可授...
    • 3 篇 船舶与海洋工程
    • 3 篇 环境科学与工程(可...
    • 2 篇 力学(可授工学、理...
  • 140 篇 理学
    • 86 篇 数学
    • 23 篇 物理学
    • 17 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 6 篇 系统科学
    • 5 篇 科学技术史(分学科...
    • 3 篇 化学
    • 3 篇 生态学
  • 17 篇 管理学
    • 16 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 14 篇 医学
    • 7 篇 临床医学
    • 6 篇 基础医学(可授医学...
  • 12 篇 教育学
    • 10 篇 心理学(可授教育学...
    • 2 篇 教育学
  • 10 篇 农学
  • 8 篇 经济学
    • 7 篇 应用经济学
  • 5 篇 哲学
    • 5 篇 哲学
  • 4 篇 文学
    • 3 篇 外国语言文学
  • 2 篇 法学
  • 2 篇 历史学
    • 2 篇 世界史

主题

  • 293 篇 algorithmic comp...
  • 11 篇 computational co...
  • 8 篇 entropy
  • 8 篇 complexity
  • 6 篇 approximation al...
  • 5 篇 algorithms
  • 5 篇 randomness
  • 4 篇 performance
  • 4 篇 modeling
  • 4 篇 algorithmic info...
  • 4 篇 complexity class...
  • 4 篇 incremental comp...
  • 4 篇 mixed hypergraph
  • 4 篇 optimization
  • 4 篇 noise
  • 4 篇 information cont...
  • 4 篇 machine learning
  • 4 篇 complexity theor...
  • 4 篇 np-complete
  • 4 篇 turing machine

机构

  • 4 篇 univ seville grp...
  • 2 篇 univ fed flumine...
  • 2 篇 odessa
  • 2 篇 carleton univ sc...
  • 2 篇 lomonosov moscow...
  • 2 篇 budapest univ te...
  • 2 篇 santa fe inst 13...
  • 2 篇 ecole prat haute...
  • 2 篇 univ estadual ca...
  • 2 篇 massey univ well...
  • 2 篇 univ fed rio de ...
  • 2 篇 univ pannonia de...
  • 2 篇 univ auckland de...
  • 2 篇 hungarian acad s...
  • 2 篇 moscow mv lomono...
  • 2 篇 weta digital wel...
  • 2 篇 labores algorith...
  • 2 篇 univ mar del pla...
  • 2 篇 univ pannonia de...
  • 2 篇 hungarian acad s...

作者

  • 10 篇 zenil hector
  • 10 篇 fertin guillaume
  • 7 篇 gauvrit nicolas
  • 6 篇 jean geraldine
  • 6 篇 soler-toscano fe...
  • 5 篇 tuza zsolt
  • 4 篇 franz arthur
  • 4 篇 delahaye jean-pa...
  • 4 篇 bouhamed heni
  • 4 篇 masmoudi afif
  • 3 篇 danchin antoine
  • 3 篇 rusu irena
  • 3 篇 lecroq thierry
  • 3 篇 retvari gabor
  • 3 篇 bulteau laurent
  • 3 篇 bujtas csilla
  • 3 篇 rebai ahmed
  • 2 篇 akian marianne
  • 2 篇 anand m
  • 2 篇 sanchez jr

语言

  • 267 篇 英文
  • 22 篇 其他
  • 2 篇 中文
  • 1 篇 德文
  • 1 篇 西班牙文
  • 1 篇 法文
  • 1 篇 荷兰文
检索条件"主题词=Algorithmic complexity"
293 条 记 录,以下是131-140 订阅
排序:
Uniquely colorable mixed hypergraphs
收藏 引用
DISCRETE MATHEMATICS 2002年 第1-3期248卷 221-236页
作者: Tuna, Z Voloshin, V Zhou, HS Moldovan Acad Sci Inst Math & Comp Sci MD-2028 Kishinev Moldova Hungarian Acad Sci Inst Comp & Automat H-1111 Budapest Hungary Georgia State Univ Dept Math & Comp Sci Atlanta GA 30303 USA
A mixed hypergraph consists of two families of edges: the C-edges and D-edges. In a coloring, every C-edge has at least two vertices of the same color, while every D-edge has at least two vertices colored differently.... 详细信息
来源: 评论
SMOOTHING AND MATCHING OF 3-D SPACE-CURVES
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER VISION 1994年 第1期12卷 79-104页
作者: GUEZIEC, A AYACHE, N INRIA EPIDAURE PROJECTF-06902 SOPHIA ANTIPOLISFRANCE
We present a new approach to the problem of matching 3-D curves. The approach has a low algorithmic complexity in the number of models, and can operate in the presence of noise and partial occlusions. Our method build... 详细信息
来源: 评论
Development of dynamic protection against timing channels
收藏 引用
INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2017年 第6期16卷 641-651页
作者: Kananizadeh, Shahrzad Kononenko, Kirill Saarland Univ Dept Comp Sci Saarbrucken Germany Ecole Normale Super INRIA Paris France
Information systems face many threats, such as covert channels, which declassify hidden information by, e.g., analyzing the program execution time. Such threats exist at various stages of the execution of instructions... 详细信息
来源: 评论
Information retrieval with unambiguous output
收藏 引用
INFORMATION AND COMPUTATION 2015年 242卷 354-368页
作者: Junnila, Ville Laihonen, Tero Univ Turku Dept Math & Stat FI-20014 Turku Finland
The main problem in information storage has previously been how large amounts of data can be stored. However, the technological development over the years has been able to give rather satisfactory answers to this prob... 详细信息
来源: 评论
A NOTE ON THE VECTORIZATION OF SCALAR RECURSIONS
收藏 引用
PARALLEL COMPUTING 1986年 第1期3卷 73-83页
作者: AXELSSON, O EIJKHOUT, V Department of Mathematics Catholic University Nijmegen Netherlands
A comparison is made of the performance of three methods for scalar recursions (with Horner's scheme as a special case) on vector computers.
来源: 评论
An inverse kinetic theory for the incompressible Navier-Stokes equations
收藏 引用
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2005年 第2-4期355卷 233-250页
作者: Ellero, M Tessarotto, M Univ Sydney Sch Aerosp Mech & Mech Engn Sydney NSW 2006 Australia Univ Trieste Dept Math & Informat I-34127 Trieste Italy
An inverse kinetic theory applying specifically to incompressible Newtonian fluids which permits us to avoid the N-2 algorithmic complexity of the Poisson equation for the fluid pressure is presented. The theory is ba... 详细信息
来源: 评论
AN ADAPTIVE NULLING SYSTEM FOR A NARROW-BAND SIGNAL WITH A LOOK-DIRECTION CONSTRAINT UTILIZING THE CONJUGATE-GRADIENT METHOD
收藏 引用
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 1989年 第7期37卷 940-944页
作者: SARKAR, TK SANGRUJI, N Department of Electrical Engineering Syracuse University Syracuse NY USA
The problem of iterative adjustments of the weights of a phased array with a look-direction constraint in the presence of jammers is presented. The technique described uses the adaptive conjugate method instead of the... 详细信息
来源: 评论
Convexity in partial cubes: The hull number
收藏 引用
DISCRETE MATHEMATICS 2016年 第2期339卷 866-876页
作者: Albenque, Marie Knauer, Kolja CNRS Ecole Polytech LIX UMR 7161 F-75700 Paris France Univ Aix Marseille CNRS LIF UMR 7279 Marseille France
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known... 详细信息
来源: 评论
MATRIX-METHOD FOR FINDING SETS OF CONTIGUOUS NON-ZERO ELEMENTS IN A TWO-DIMENSIONAL ARRAY .2.
收藏 引用
PATTERN RECOGNITION 1988年 第5期21卷 451-453页
作者: CAMPBELL, D HIGGINS, J Computer Science Department Brigham Young University Provo UT 84602 U.S.A
We present a quick method of finding sets of contiguous non-zero elements in a two-dimensional array.
来源: 评论
Bacteria as computers making computers
收藏 引用
FEMS MICROBIOLOGY REVIEWS 2009年 第1期33卷 3-26页
作者: Danchin, Antoine Inst Pasteur F-75724 Paris 15 France
Various efforts to integrate biological knowledge into networks of interactions have produced a lively microbial systems biology. Putting molecular biology and computer sciences in perspective, we review another trend... 详细信息
来源: 评论