咨询与建议

限定检索结果

文献类型

  • 518 篇 会议
  • 298 篇 期刊文献
  • 9 册 图书

馆藏范围

  • 825 篇 电子文献
  • 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
  • 17 篇 artificial intel...
  • 16 篇 educational inst...
  • 16 篇 computational mo...
  • 14 篇 humans
  • 14 篇 shape
  • 13 篇 data mining
  • 13 篇 equations
  • 12 篇 application soft...
  • 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 篇 irit dinur
  • 5 篇 macdonell stephe...
  • 5 篇 mendes emília
  • 5 篇 pinchasi rom
  • 5 篇 evangelos a. the...

语言

  • 806 篇 英文
  • 17 篇 其他
  • 2 篇 中文
检索条件"机构=Department of Applied Math. and Computer Science"
825 条 记 录,以下是121-130 订阅
排序:
Learning to perform knowledge-intensive inferences  22nd
收藏 引用
22nd International Symposium on math.matical Foundations of computer science, MFCS 1997
作者: Roth, Dan Dept. of Appl. Math. and CS Weizmann Institute of Science Rehovot76100 Israel Department of Computer Science University of Illinois UrbanaIL61801 United States
来源: 评论
On classification of 2-dimensional evolution algebras and its applications  5
On classification of 2-dimensional evolution algebras and it...
收藏 引用
5th International Conference on math.matical Applications in Engineering 2019
作者: Ahmed, H. Bekbaev, U. Rakhimov, I. Department of Math. Faculty of Science UPM Selangor Malaysia Depart. of Math. Faculty of Science Taiz University Taiz Yemen Department of Mathematical and Natural Sciences TTPU Uzbekistan Department of Science in Engineering Faculty of Engineering IIUM Malaysia Department of Mathematics Faculty of Computer and Mathematical Sciences UiTM Malaysia V.I.Romanovskiy Institute of Mathematics Uzbekistan Academy of Science Uzbekistan
In the paper we give a complete classification of 2-dimensional evolution algebras over algebraically closed fields, we compare the list of representatives of the isomorphism classes with that of obtained earlier by t... 详细信息
来源: 评论
Isotopic implicit surface meshing
Isotopic implicit surface meshing
收藏 引用
Proceedings of the 36th Annual ACM Symposium on Theory of Computing
作者: Boissonnat, Jean-Daniel Cohen-Steiner, David Vegter, Gert Projet Géometrica INRIA Sophia-Antipolis France Computer Science Department Duke University United States Inst. for Math. and Comp. Science RUG Netherlands
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear approximation of it ... 详细信息
来源: 评论
Amplification and percolation (probabilistic Boolean functions)  33
Amplification and percolation (probabilistic Boolean functio...
收藏 引用
33rd Annual Symposium on Foundations of computer science, FOCS 1992
作者: Dubiner, Moshe Zwick, Uri Dept. of Applied Math. Tel Aviv Univ. Tel Aviv69978 Israel Dept. of Computer Science Tel Aviv Univ. Tel Aviv69978 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...
来源: 评论
Co-clustering of image segments using convex optimization applied to EM neuronal reconstruction
Co-clustering of image segments using convex optimization ap...
收藏 引用
Conference on computer Vision and Pattern Recognition (CVPR)
作者: Shiv N. Vitaladevuni Ronen Basri Howard Hughes Medical Institute USA Department of Computer Science and Applied Math. Weizmann Institute of Science Israel
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structures in over-segmented electron microsc... 详细信息
来源: 评论
Multiple translational containment: Approximate and exact algorithms  6
Multiple translational containment: Approximate and exact al...
收藏 引用
6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
作者: Daniels, Karen Milenkovict, Victor J. Harvard University Division of Applied Sciences United States University of Miami Department of Math and Computer Science United States
We present exact algorithms for finding a solution to the two-dimensional translational containment problem: find translations for k polygons which place them inside a polygonal container without overlApplng. We also ... 详细信息
来源: 评论
A syntactic method for finding least fixed points of higher-order functions over finite domains
收藏 引用
Journal of Functional Programming 1997年 第4期7卷 357-394页
作者: Chuang, Tyng-Ruey Goldberg, Benjamin Institute of Information Science Academia Sinica Nankang Taipei 11529 Taiwan Department of Computer Science Courant Inst. of Math. Sciences New York University New York NY 10012 251 Mercer Street United States Department of Computer Science New York University United States
This paper describes a method for finding the least fixed points of higher-order functions over finite domains using symbolic manipulation. Fixed point finding is an essential component in the calculation of abstract ...
来源: 评论
Boundary recognition in sensor networks by topological methods
Boundary recognition in sensor networks by topological metho...
收藏 引用
12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006
作者: Wang, Yue Gao, Jie Mitchell, Joseph S. B. Dept. of Computer Science Stony Brook University Stony Brook NY United States Dept. of Applied Math. and Statistics Stony Brook University Stony Brook NY United States
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to both sensor network applications and the ... 详细信息
来源: 评论
Compositional modeling of reactive systems using open nets  12th
收藏 引用
12th International Conference on Concurrency Theory, CONCUR 2001
作者: Baldan, P. Corradini, A. Ehrig, H. Heckel, R. Dipartimento di Informatica Università di Pisa Italy Computer Science Department Technical University of Berlin Germany Dept. of Math. and Comp. Science University of Paderborn Germany
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designated as open, represent an interface of ... 详细信息
来源: 评论
Enumeration of binary trees, Lempel-Ziv'78 parsings, and universal types
Enumeration of binary trees, Lempel-Ziv'78 parsings, and uni...
收藏 引用
Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics
作者: Knessl, Charles Szpankowski, Wojciech Dept. Math. Stat. and Computer Science University of Illinois at Chicago Chicago IL 60607-7045 United States Department of Computer Science Purdue University West Lafayette IN 47907-2066 United States
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them, The number of such trees with n nodes is now known as the Catalan number. Over the years various int... 详细信息
来源: 评论