咨询与建议

限定检索结果

文献类型

  • 518 篇 会议
  • 298 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 424 篇 工学
    • 319 篇 计算机科学与技术...
    • 248 篇 软件工程
    • 77 篇 信息与通信工程
    • 58 篇 控制科学与工程
    • 30 篇 生物工程
    • 27 篇 电气工程
    • 26 篇 化学工程与技术
    • 24 篇 机械工程
    • 19 篇 动力工程及工程热...
    • 19 篇 电子科学与技术(可...
    • 17 篇 生物医学工程(可授...
    • 15 篇 力学(可授工学、理...
    • 15 篇 光学工程
    • 15 篇 仪器科学与技术
    • 15 篇 材料科学与工程(可...
    • 7 篇 航空宇航科学与技...
  • 370 篇 理学
    • 302 篇 数学
    • 92 篇 统计学(可授理学、...
    • 61 篇 物理学
    • 39 篇 生物学
    • 28 篇 系统科学
    • 27 篇 化学
  • 80 篇 管理学
    • 42 篇 管理科学与工程(可...
    • 38 篇 图书情报与档案管...
    • 28 篇 工商管理
  • 13 篇 教育学
    • 13 篇 教育学
  • 12 篇 经济学
    • 12 篇 应用经济学
  • 12 篇 医学
    • 10 篇 临床医学
    • 8 篇 基础医学(可授医学...
  • 7 篇 法学
    • 6 篇 社会学
  • 5 篇 农学
  • 1 篇 哲学
  • 1 篇 文学
  • 1 篇 历史学
  • 1 篇 军事学
  • 1 篇 艺术学

主题

  • 118 篇 computer science
  • 40 篇 mathematics
  • 19 篇 algorithm design...
  • 19 篇 polynomials
  • 16 篇 educational inst...
  • 16 篇 computational mo...
  • 14 篇 humans
  • 14 篇 shape
  • 13 篇 data mining
  • 13 篇 equations
  • 12 篇 application soft...
  • 12 篇 artificial intel...
  • 11 篇 routing
  • 11 篇 mathematical mod...
  • 11 篇 layout
  • 10 篇 concurrent compu...
  • 10 篇 control systems
  • 10 篇 topology
  • 10 篇 robustness
  • 9 篇 cameras

机构

  • 21 篇 department of co...
  • 11 篇 math. division n...
  • 11 篇 department of ma...
  • 9 篇 college of mathe...
  • 8 篇 courant inst. of...
  • 7 篇 department of ap...
  • 7 篇 inst. math. stoc...
  • 6 篇 department of co...
  • 6 篇 department of co...
  • 6 篇 machine learning...
  • 6 篇 department of ap...
  • 5 篇 department of ap...
  • 5 篇 school of comput...
  • 5 篇 research centre ...
  • 5 篇 department of ap...
  • 5 篇 dept. of math. a...
  • 4 篇 department of ma...
  • 4 篇 math. research i...
  • 4 篇 department of co...
  • 4 篇 department of ma...

作者

  • 11 篇 naor moni
  • 11 篇 ban jung-chao
  • 9 篇 hu wen-guei
  • 9 篇 sharir micha
  • 8 篇 alsmeyer gerold
  • 8 篇 m. irani
  • 8 篇 lai guan-yu
  • 7 篇 r. basri
  • 6 篇 hemaspaandra edi...
  • 6 篇 krishnaswamy smi...
  • 6 篇 srivastava gauta...
  • 6 篇 fitzsimmons zack
  • 6 篇 wu yu-liang
  • 5 篇 chang chih-hung
  • 5 篇 maldonado josé c...
  • 5 篇 macdonell stephe...
  • 5 篇 mendes emília
  • 5 篇 pinchasi rom
  • 5 篇 evangelos a. the...
  • 5 篇 lin jerry chun-w...

语言

  • 797 篇 英文
  • 17 篇 其他
  • 2 篇 中文
检索条件"机构=Department of Applied Math. and Computer Science"
816 条 记 录,以下是781-790 订阅
排序:
Associative parallel lexing
Associative parallel lexing
收藏 引用
International Symposium on Parallel Processing
作者: C.R. Asthagiri J.L. Potter CIS Department Cleveland State University Cleveland OH USA Department of Math. & Computer Science Kent University Kent OH USA
Presents near constant time associative parallel lexing (APL) algorithms. The best time complexity thus far claimed is O(logn) (n denotes the number of input characters for the parallel prefix lexing (PPL) algorithm. ... 详细信息
来源: 评论
Modeling human visual object recognition
Modeling human visual object recognition
收藏 引用
International Joint Conference on Neural Networks (IJCNN)
作者: S. Edelman H.H. Bulthoff Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel Dept. of Appl. Math. & Comput. Sci. Weizmann Inst. of Sci. Rehovot Israel
The topics discussed here are network models of object recognition; a computational theory of recognition; psychophysical support for a view-interpolation model: and an open issue, features of recognition. The authors... 详细信息
来源: 评论
Optimal early stopping in distributed consensus  6th
Optimal early stopping in distributed consensus
收藏 引用
6th International Workshop on Distributed Algorithms, WDAG 1992
作者: Berman, Piotr Garay, Juan A. Perry, Kenneth J. Department of Computer Science The Pennsylvania State University University ParkPA16802 United States Dept. of Applied Math and Computer Science The Weizmann Institute of Science Rehovot76100 Israel IBM T.J. Watson Research Center P.O. Box 704 Yorktown HeightsNY10598 United States
The Distributed Consensus problem involves n processors each of which holds an initial binary value. At most t processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the ... 详细信息
来源: 评论
Witnesses for Boolean matrix multiplication and for shortest paths  33
Witnesses for Boolean matrix multiplication and for shortest...
收藏 引用
33rd Annual Symposium on Foundations of computer science, FOCS 1992
作者: Alon, Noga Galil, Zvi Margalit, Oded Naor, Moni Dept. of Math. Tel Aviv Univ. Israel Department of Computer Science Tel Aviv University Tel Aviv69978 Israel Columbia University New YorkNY10027 United States IBM Almaden Research Center San JoseCA95120 United States
The subcubic (O(nw) for w(3) algorithms to multiply Boolean matrices do not provide the witnesses;namely, they compute C=A.B but if Cij=1 they do not find an index k (a witness) such that Aik=Bkj=1. The authors design... 详细信息
来源: 评论
Amplification and percolation (probabilistic Boolean functions)
Amplification and percolation (probabilistic Boolean functio...
收藏 引用
Annual IEEE Symposium on Foundations of computer science
作者: M. Dubiner U. Zwick Department of Applied Math Tel-Aviv University Tel-Aviv Israel Department of Computer Science Tel-Aviv University Tel-Aviv Israel
The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They... 详细信息
来源: 评论
Data-parallel compilation and query power extension of large knowledge bases
Data-parallel compilation and query power extension of large...
收藏 引用
International Conference on Tools for Artificial Intelligence (ICTAI)
作者: A.K. Bansal J.L. Potter L.V. Prasad Dept. of Math. & Comput. Sci. Kent State Univ. OH USA Department of Mathematics and Computer Science Kent University Kent OH USA
An associative data-parallel compilation model of logic programs capable of answering queries with unspecified relations concerning the given objects is described. The model benefits from the synergy resulting from as... 详细信息
来源: 评论
Model based concordance compression
Model based concordance compression
收藏 引用
Data Compression Conference (DCC)
作者: A. Bookstein S.T. Klein T. Raita Center for Information and Language Studies University of Chicago Chicago IL USA Departments of Math. & CS and Economics & BA Bar-llan University Ramat-Gan Israel Department of Computer Science University of Turku Turku Finland
The authors discuss concordance compression using the framework now customary in compression theory. They begin by creating a math.matical model of concordance generation, and then use optimal compression engines, suc... 详细信息
来源: 评论
The algorithmic aspects of the regularity lemma  33
The algorithmic aspects of the regularity lemma
收藏 引用
33rd Annual Symposium on Foundations of computer science, FOCS 1992
作者: Alon, N. Duke, R.A. Lefmann, H. Rödl, V. Yuster, R. Dept. of Math. Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv Univ. Tel Aviv Israel Bellcore MorristownNJ07960 United States School of Mathematics Georgia Institute of Technology AtlantaGA30332 United States Fakultat fur Mathematik SFB 343 Universitat Bielefeld Bielefeld 1W-4800 Germany Department of Mathematics and Computer Science Emory University AtlantaGA30322 United States
The regularity lemma of Szemeredi (1978) is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic. The author... 详细信息
来源: 评论
Analysis of the tap changer related voltage collapse phenomena for the large electric power system
Analysis of the tap changer related voltage collapse phenome...
收藏 引用
IEEE Conference on Decision and Control
作者: V. Venkatasubramanian H. Schattler J. Zaborszky School of Electrical Engineering and Computer Science Washington State University Pullman WA USA Department of Systems Science and Mathematics Washington University Saint Louis MO USA Dept. of Syst. Sci. & Math. Washington Univ. St. Louis MO USA
It is shown that nonsmooth events, such as tap changing can be integrated into the framework of a general theory recently presented by the authors (1991,1992) on the dynamics of large power systems modeled by smooth e... 详细信息
来源: 评论
A NOTE ON A NEW THEORY OF TURBULENCE
收藏 引用
applied math.matics and Mechanics(English Edition) 1991年 第1期12卷 101-105页
作者: 蔡树棠 林多敏 Department of Modern Mechanics University of Science and Technology of China Hefei Shanghai Institute of Applied Math. and Mechanics Shanghai Shanghai University of Technology Shanghai
In this paper, the creation and annihilation of turbulent eddies are described as elementary particles in the quantum field theory. An elementary particle mav be considered as a solid entity as it exists in quantum th... 详细信息
来源: 评论