咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是4821-4830 订阅
排序:
Graphs with maximal induced matchings of the same size
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 第Part1期216卷 15-28页
作者: Baptiste, Philippe Kovalyov, Mikhail Y. Orlovich, Yury L. Werner, Frank Zverovich, Igor E. Ecole Polytech Lab Informat CNRS LIX F-91128 Palaiseau France Natl Acad Sci Belarus United Inst Informat Problems 6 Surganova Str Minsk 220012 BELARUS Belarusian State Univ Fac Appl Math & Comp Sci Dept Discrete Math & Algorithm Nezavisimosti Ave 4 Minsk 220030 BELARUS Otto Von Guericke Univ Inst Math Optimizat Univ Pl 2 D-39106 Magdeburg Germany Belarusian State Univ Fac Mech & Math Dept Math Cybernet Nezavisimosti Ave 4 Minsk 220030 BELARUS
A graph is well-indumatched if all its maximal induced matchings are of the same size. We first prove that recognizing whether a graph is well-indumatched is a co-NP-complete problem even for (2P(5), K-1,K-5)-free gra... 详细信息
来源: 评论
ANALYSIS SYNTHESIS TECHNIQUES FOR SUBBAND IMAGE-CODING
收藏 引用
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1990年 第8期38卷 1446-1456页
作者: SMITH, MJT EDDINS, SL School of Electrical Engineering Georgia Institute of Technology Atlanta GA USA
Analysis/synthesis systems designed for low bit rate image coding, their impact on overall system quality, and their computational complexity are discussed. The investigation focuses on the design of analysis/synthesi... 详细信息
来源: 评论
Unbounded parallel-batch scheduling with drop-line tasks
收藏 引用
JOURNAL OF SCHEDULING 2019年 第4期22卷 449-463页
作者: Gao, Yuan Yuan, Jinjiang Wei, Zhigang Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Henan Peoples R China Zhengzhou XindaJiean Informat Technol Co Ltd Zhengzhou 450001 Henan Peoples R China
In this paper, we study unbounded parallel-batch scheduling with drop-line tasks to minimize a regular objective function, where by drop-line tasks we mean that the completion time of each task (job) is equal to the s... 详细信息
来源: 评论
Multivariable optimisation approach for power allocation in OFDM-DCSK system
收藏 引用
IET COMMUNICATIONS 2019年 第13期13卷 1869-1876页
作者: Mobini, Majid Zahabi, M. Reza Babol Noshirvani Univ Technol Dept Elect Engn Babol Sar Iran
This study proposes some multivariable approaches for power allocation in orthogonal frequency multiple access-based differential chaos shift keying (OFDM-DCSK) system. The objective is to minimise the overall bit err... 详细信息
来源: 评论
Joint User Scheduling, Base Station Clustering, and Beamforming Design Based on Deep Unfolding Technique
收藏 引用
IEEE TRANSACTIONS ON COMMUNICATIONS 2023年 第10期71卷 5831-5845页
作者: Xu, Chunmei Jia, Yuanqi He, Shiwen Huang, Yongming Niyato, Dusit Southeast Univ Sch Informat Sci & Engn Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Purple Mt Labs Nanjing 210096 Peoples R China Cent South Univ Sch Comp Sci & Engn Changsha 410083 Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore
In this paper, we investigate joint user (UE) scheduling, base station (BS) clustering and beamforming design in a dense network. To reduce the computation burden, we propose a deep unfolding UE scheduling, BS cluster... 详细信息
来源: 评论
Fast, rank adaptive subspace tracking and applications
收藏 引用
IEEE TRANSACTIONS ON SIGNAL PROCESSING 1996年 第9期44卷 2229-2244页
作者: Rabideau, DJ Lincoln Laboratory Massachusetts Institute of Technology Lexington MA USA
High computational complexity and inadequate parallelism have deterred the use of subspace-based algorithms in real-time systems, Recently, we proposed a new class of fast subspace tracking (FST) algorithms that overc... 详细信息
来源: 评论
A polynomial time algorithm for GapCVPP in l1 norm
收藏 引用
Science China(Information Sciences) 2014年 第3期57卷 112-118页
作者: TIAN ChengLiang HAN LiDong XU GuangWu Key Laboratory of Cryptologic Technology and Information Security Ministry of EducationShandong University School of Mathematics Shandong University Institute for Advanced Study Tsinghua University Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee
This paper concerns the hardness of approximating the closest vector in a lattice with preprocessing in l1norm,and gives a polynomial time algorithm for GapCVPPγin l1norm with gapγ=O(n/log n).The gap is smaller than... 详细信息
来源: 评论
Efficient Two-Stage Discrete Bit-Loading Algorithms for OFDM Systems
收藏 引用
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2010年 第7期59卷 3407-3416页
作者: Wang, Deqiang Cao, Yewen Zheng, Laibo Shandong Univ Sch Informat Sci & Engn Jinan 250100 Peoples R China
Aiming at minimizing the transmit power of orthogonal frequency-division multiplexing (OFDM) systems subject to the target data rate, the target bit error rate (BER), the maximum allowable power per subcarrier, and th... 详细信息
来源: 评论
Improved simple set-membership affine projection algorithm for sparse system modelling: Analysis and implementation
收藏 引用
IET SIGNAL PROCESSING 2020年 第2期14卷 81-88页
作者: Yazdanpanah, Hamed Diniz, Paulo S. R. Lima, Markus V. S. Univ Sao Paulo Dept Comp Sci Inst Math & Stat Sao Paulo Brazil Univ Fed Rio de Janeiro Program Elect Engn PEE COPPE Rio de Janeiro Brazil
Recently, the improved simple set-membership affine projection (IS-SM-AP) algorithm has been proposed in order to exploit sparsity in system models. Although its update equation resembles that of the set-membership af... 详细信息
来源: 评论
Ranking primitive recursions: The low Grzegorczyk classes revisited
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第2期29卷 401-415页
作者: Bellantoni, SJ Niggl, KH Tech Univ Ilmenau Fak Informat & Automat D-98684 Ilmenau Germany Univ Munich Munich Germany
Traditional results in subrecursion theory are integrated with the recent work in "predicative recursion" by defining a simple ranking rho of all primitive recursive functions. The hierarchy defined by this ... 详细信息
来源: 评论