咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是141-150 订阅
排序:
Across Scales and Across Dimensions: Temporal Super-Resolution Using Deep Internal Learning  1
收藏 引用
16th European Conference on computer Vision, ECCV 2020
作者: Zuckerman, Liad Pollak Naor, Eyal Pisha, George Bagon, Shai Irani, Michal Department of Computer Science and Applied Math The Weizmann Institute of Science Rehovot Israel Rehovot Israel Technion Israel Institute of Technology Haifa Israel
When a very fast dynamic event is recorded with a low-framerate camera, the resulting video suffers from severe motion blur (due to exposure time) and motion aliasing (due to low sampling rate in time). True Temporal ... 详细信息
来源: 评论
Õ(√n)-space and polynomial-time algorithm for planar directed graph reachability
Õ(√n)-space and polynomial-time algorithm for planar direc...
收藏 引用
39th International Symposium on math.matical Foundations of computer science, MFCS 2014
作者: Asano, Tetsuo Kirkpatrick, David Nakagawa, Kotaro Watanabe, Osamu Japan Advanced Institute of Technology Japan Department of Computer Science University of British Columbia Canada Department of Math. and Comput. Sci. Tokyo Institute of Technology Japan
The directed graph reachability problem takes as input an n-vertex directed graph G=(V,E), and two distinguished vertices v 0, and vertex v *. The problem is to determine whether there exists a path from v 0 to v * in... 详细信息
来源: 评论
Efficient determination of shape from multiple images containing partial information
Efficient determination of shape from multiple images contai...
收藏 引用
13th International Conference on Pattern Recognition, ICPR 1996
作者: Basri, Ronen Grove, Adam Jacobs, David Department of Applied Math. Weizmann Inst. of Science Rehovot 76 100 Israel NEC Research Institute 4 Independence Way Princeton NJ 08540 United States
We consider the problem of reconstructing the shape of an object from multiple images related by translations, when only small portions of the object can be observed in each image. Lindenbaum and Bruckstein (1988) hav... 详细信息
来源: 评论
Simulation of heterogeneous networks  94
Simulation of heterogeneous networks
收藏 引用
Simulation Winter Conference
作者: M. Rumekasten Department of Math. & Computer Science University of Paderborn Germany
This paper presents a simulation tool to help the network designer to identify the optimum network design parameters for a heterogeneous network environment. The tool consists of two parts: simulation modules and a us... 详细信息
来源: 评论
Global Behavior of Solutions of xn+1 = max{xn, A}/xnxn-1
收藏 引用
Journal of Computational Analysis and Applications 2000年 第3期2卷 237-252页
作者: Feuer, J. Janowski, E.J. Ladas, G. Teixeira, C. Dept. of Math. and Computer Science Merrimack College North Andover MA 01845 United States Department of Mathematics University of Rhode Island Kingston RI 02881-0816 United States
We investigate the asymptotic behavior, the oscillatory character, and the periodic nature of solutions of the difference equation xn+1 = max{xn, A}/xnxn-1, n = 0, 1, . . . where A is a real parameter and the initial ... 详细信息
来源: 评论
Recognition by prototypes
Recognition by prototypes
收藏 引用
Conference on computer Vision and Pattern Recognition (CVPR)
作者: R. Basri Department of Applied Math. Weizmann Institute of Science Rehovot Israel
A scheme for recognizing 3D objects from single 2D images is introduced. The scheme proceeds in two stages. In the categorization stage, the image is matched against prototype objects, and in the identification stage,... 详细信息
来源: 评论
On the complexity of finding paths in a two-dimensional domain II: Piecewise straight-line paths
On the complexity of finding paths in a two-dimensional doma...
收藏 引用
作者: Chou, Arthur W. Ko, Ker-I Dept. of Math. and Computer Science Clark University Worcester MA 01610 United States Department of Computer Science State Univ. New York at Stony Brook Stony Brook NY 11794 United States
The problem of finding a piecewise straight-line path, with a constant number of line segments, in a two-dimensional domain is studied in the Turing machine-based computational model and in the discrete complexity the... 详细信息
来源: 评论
Document segmentation using wavelet-domain multi-state hidden Markov models
Document segmentation using wavelet-domain multi-state hidde...
收藏 引用
Proceedings of 2002 International Conference on Machine Learning and Cybernetics
作者: Song, Jin-Ping Yang, Xiao-Yi Hou, Yu-Hua Tang, Yuan Y. Coll. of Math. and Information Sci. Henan University Henan China Department of Computer Science Hong Kong Baptist University Kowloon Tong Hong Kong
This paper presents a new document segmentation algorithm, called context-adapted wavelet-domain hidden Markov tree (CAHMT) model, which extends a recently emerged wavelet-domain hidden Markov tree (HMT) model. The pr... 详细信息
来源: 评论
Determining Roundness of Sedimentary Particles
Determining Roundness of Sedimentary Particles
收藏 引用
Proceedings of the Fifth Joint Conference on Information sciences, JCIS 2000
作者: Drevin, Günther R. Reyneke, Adri Du Plessis, Michelle Department of Computer Science Sch. for Comp. Stat./Math. Sciences Potchefstroom University Private Bag X6001 Potchefstroom South Africa
The study of the shapes of sedimentary particles was presented. The shape of the particle was described by using the roundness as the measurement factor. The analysis study utilized a Fourier transform method to obtai... 详细信息
来源: 评论
Broadcast encryption  13th
Broadcast encryption
收藏 引用
13th Annual International Conference on Advances in Cryptology, CRYPT0 1993
作者: Fiat, Amos Naor, Moni Department of Computer Science School of Mathematics Tel Aviv University Tel Aviv Israel Algorithmic Research Ltd United States Department of Computer Science and Applied Math Weizmann Institute Rehovot Israel
We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to broadcast secure trans... 详细信息
来源: 评论