咨询与建议

限定检索结果

文献类型

  • 20,219 篇 会议
  • 13,195 篇 期刊文献
  • 76 篇 学位论文
  • 73 册 图书
  • 15 篇 科技报告

馆藏范围

  • 33,563 篇 电子文献
  • 21 种 纸本馆藏

日期分布

学科分类号

  • 18,904 篇 工学
    • 11,985 篇 计算机科学与技术...
    • 6,317 篇 电气工程
    • 3,349 篇 信息与通信工程
    • 2,855 篇 软件工程
    • 1,580 篇 控制科学与工程
    • 1,375 篇 电子科学与技术(可...
    • 668 篇 仪器科学与技术
    • 522 篇 机械工程
    • 287 篇 交通运输工程
    • 263 篇 生物工程
    • 237 篇 光学工程
    • 218 篇 材料科学与工程(可...
    • 201 篇 化学工程与技术
    • 198 篇 生物医学工程(可授...
    • 158 篇 航空宇航科学与技...
    • 146 篇 力学(可授工学、理...
    • 128 篇 动力工程及工程热...
  • 8,414 篇 理学
    • 6,191 篇 数学
    • 1,558 篇 物理学
    • 888 篇 统计学(可授理学、...
    • 580 篇 系统科学
    • 486 篇 生物学
    • 228 篇 化学
  • 1,990 篇 管理学
    • 1,709 篇 管理科学与工程(可...
    • 303 篇 工商管理
    • 275 篇 图书情报与档案管...
  • 624 篇 医学
    • 456 篇 临床医学
    • 159 篇 基础医学(可授医学...
  • 280 篇 经济学
    • 188 篇 应用经济学
  • 166 篇 法学
    • 134 篇 社会学
  • 140 篇 农学
  • 131 篇 文学
  • 75 篇 教育学
  • 67 篇 哲学
  • 57 篇 军事学
  • 24 篇 艺术学
  • 9 篇 历史学

主题

  • 33,578 篇 computational co...
  • 2,187 篇 computational mo...
  • 1,102 篇 algorithm design...
  • 977 篇 polynomials
  • 945 篇 decoding
  • 906 篇 computer science
  • 883 篇 convergence
  • 883 篇 signal processin...
  • 619 篇 motion estimatio...
  • 607 篇 robustness
  • 598 篇 encoding
  • 585 篇 video coding
  • 582 篇 mimo
  • 569 篇 signal processin...
  • 530 篇 optimization
  • 514 篇 computer archite...
  • 511 篇 ofdm
  • 509 篇 detectors
  • 497 篇 hardware
  • 487 篇 feature extracti...

机构

  • 39 篇 department of el...
  • 32 篇 institute for in...
  • 31 篇 beijing inst tec...
  • 31 篇 school of electr...
  • 28 篇 school of comput...
  • 28 篇 univ chicago dep...
  • 26 篇 department of el...
  • 25 篇 univ elect sci &...
  • 22 篇 national mobile ...
  • 22 篇 school of electr...
  • 21 篇 tsinghua univers...
  • 20 篇 ibm thomas j. wa...
  • 20 篇 univ dusseldorf ...
  • 20 篇 school of inform...
  • 20 篇 institute of com...
  • 20 篇 univ liverpool d...
  • 19 篇 princeton univ d...
  • 19 篇 eindhoven univ t...
  • 19 篇 univ warwick dep...
  • 18 篇 department of el...

作者

  • 62 篇 woeginger gerhar...
  • 24 篇 fortnow l
  • 24 篇 jonsson peter
  • 22 篇 wei liu
  • 20 篇 yui-lam chan
  • 20 篇 chin-liang wang
  • 18 篇 manzoni luca
  • 18 篇 liu yang
  • 18 篇 bollig beate
  • 17 篇 lutz jack h.
  • 17 篇 dunne paul e.
  • 16 篇 bin wang
  • 16 篇 yang yang
  • 16 篇 fertin guillaume
  • 16 篇 dondi riccardo
  • 15 篇 luciano agostini
  • 15 篇 agostini luciano
  • 15 篇 jun wang
  • 15 篇 guo jiong
  • 15 篇 nie feiping

语言

  • 32,398 篇 英文
  • 907 篇 其他
  • 229 篇 中文
  • 17 篇 法文
  • 12 篇 俄文
  • 7 篇 日文
  • 6 篇 土耳其文
  • 2 篇 西班牙文
  • 2 篇 朝鲜文
  • 1 篇 德文
  • 1 篇 葡萄牙文
检索条件"主题词=computational complexity"
33578 条 记 录,以下是201-210 订阅
排序:
computational complexity of Hierarchically Adapted Meshes  20th
Computational Complexity of Hierarchically Adapted Meshes
收藏 引用
20th Annual International Conference on computational Science (ICCS)
作者: Skotniczny, Marcin AGH Univ Sci & Technol Fac Comp Sci Elect & Telecommun Dept Comp Sci Al Adama Mickiewicza 30 PL-30059 Krakow Poland
We show that for meshes hierarchically adapted towards singularities there exists an order of variable elimination for direct solvers that will result in time complexity not worse than O(max(N, N3q-1/q)), where N is t... 详细信息
来源: 评论
computational complexity of polyadic lifts of generalized quantifiers in natural language
收藏 引用
LINGUISTICS AND PHILOSOPHY 2010年 第3期33卷 215-250页
作者: Szymanik, Jakub Stockholm Univ Dept Philosophy S-10691 Stockholm Sweden
We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that... 详细信息
来源: 评论
computational complexity and applications of quantum algorithm
Computational complexity and applications of quantum algorit...
收藏 引用
International Workshop on Infinite and Infinitesimal in Mathematics, Computing and Natural Sciences (INFINITY)
作者: Iriyama, S. Ohya, M. Tokyo Univ Sci Noda Chiba 278 Japan
We have studied on quantum algorithm several years, and introduced a mathematical model of it in order to discuss the computational complexity. Our model of quantum algorithm, called a generalized quantum Turing machi... 详细信息
来源: 评论
computational complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games  16th
Computational Complexity of Decision Problems About Nash Equ...
收藏 引用
16th International Symposium on Algorithmic Game Theory (SAGT)
作者: Bilo, Vittorio Hansen, Kristoffer Arnsfelt Mavronicolas, Marios Univ Salento Lecce Italy Aarhus Univ Aarhus Denmark Univ Cyprus Nicosia Cyprus
We revisit the computational complexity of decision problems about existence of Nash equilibria in multi-player games satisfying certain natural properties. Such problems have generally been shown to be complete for t... 详细信息
来源: 评论
computational complexity Scalable Scheme for Power-Aware H.264/AVC Encoding
Computational Complexity Scalable Scheme for Power-Aware H.2...
收藏 引用
IEEE International Workshop on Multimedia Signal Processing
作者: Lee, Hoyoung Jung, Bongsoo Jung, Jooyoung Jeon, Byeungwoo Sungkyunkwan Univ Dept Elect & Elect Engn Suwon 440746 South Korea
Recent development of portable devices and prevalence of high-throughput communication infrastructures make the video encoding in portable devices on high demand. However, its computational complexity makes the implem... 详细信息
来源: 评论
computational complexity Reduction of Two-Channel PMWF Using Frequency Averaging Technique
Computational Complexity Reduction of Two-Channel PMWF Using...
收藏 引用
IEEE International Conference on Consumer Electronics (ICCE)
作者: Kim, Youngil Seo, Kiwon Jeong, Sangbae Gyeongsang Natl Univ Jinju South Korea
This paper proposes a frequency averaging method to reduce computational complexity for the implementation of a two-channel parameterized multichannel Wiener filter (PMWF) algorithm. Experimental results show that the... 详细信息
来源: 评论
computational complexity of Stochastic Programming: Monte Carlo Sampling Approach
收藏 引用
International Congress of Mathematicians (ICM 2010)
作者: Shapiro, Alexander Georgia Inst Technol Atlanta GA 30332 USA
For a long time modeling approaches to stochastic programming were dominated by scenario generation methods. Consequently the main computational effort went into development of decomposition type algorithms for solvin... 详细信息
来源: 评论
computational complexity of the network routing logical security assessment process  1
Computational complexity of the network routing logical secu...
收藏 引用
1st IEEE International Workshop on Information Assurance (IWIA 2003)
作者: Llorens, C Valois, D Le Teigner, Y Gibouin, A Equant Network Secur Dept F-92904 Paris France
We present in this paper how to assess the network routing logical security policy of an Internet Service Provider network, through a reverse-engineering process performed on the network routers configurations. This p... 详细信息
来源: 评论
computational complexity of Core Fragments of Modal Logics T, K4, and S4  16th
Computational Complexity of Core Fragments of Modal Logics T...
收藏 引用
16th European Conference on Logics in Artificial Intelligence (JELIA)
作者: Walega, Przemyslaw Andrzej Univ Oxford Dept Comp Sci Oxford England Univ Warsaw Inst Philosophy Warsaw Poland
We show that the satisfiability problem in core fragments of modal logics T, K4, and S4 in whose languages diamond modal operators are disallowed is NL-complete. Moreover, we provide deterministic procedures for satis... 详细信息
来源: 评论
computational complexity in entanglement transformations
Computational complexity in entanglement transformations
收藏 引用
作者: Chitambar, Eric A. University of Michigan
学位级别:Ph.D.
In physics, systems having three parts are typically much more difficult to analyze than those having just two. Even in classical mechanics, predicting the motion of three interacting celestial bodies remains an insur... 详细信息
来源: 评论