咨询与建议

限定检索结果

文献类型

  • 179 篇 会议
  • 143 篇 期刊文献
  • 6 册 图书

馆藏范围

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

日期分布

学科分类号

  • 196 篇 理学
    • 132 篇 数学
    • 68 篇 物理学
    • 30 篇 统计学(可授理学、...
    • 18 篇 天文学
    • 15 篇 生物学
    • 11 篇 化学
    • 8 篇 系统科学
    • 6 篇 地球物理学
  • 193 篇 工学
    • 120 篇 计算机科学与技术...
    • 86 篇 软件工程
    • 30 篇 信息与通信工程
    • 28 篇 控制科学与工程
    • 21 篇 核科学与技术
    • 17 篇 电子科学与技术(可...
    • 14 篇 电气工程
    • 14 篇 生物医学工程(可授...
    • 14 篇 生物工程
    • 13 篇 光学工程
    • 11 篇 仪器科学与技术
    • 9 篇 化学工程与技术
    • 8 篇 力学(可授工学、理...
    • 7 篇 机械工程
    • 5 篇 材料科学与工程(可...
  • 39 篇 管理学
    • 24 篇 管理科学与工程(可...
    • 14 篇 图书情报与档案管...
    • 13 篇 工商管理
  • 9 篇 医学
    • 9 篇 临床医学
    • 8 篇 基础医学(可授医学...
    • 6 篇 药学(可授医学、理...
  • 6 篇 法学
    • 5 篇 社会学
  • 4 篇 经济学
  • 2 篇 教育学
  • 2 篇 农学

主题

  • 20 篇 computer science
  • 9 篇 mathematics
  • 6 篇 mobile communica...
  • 6 篇 bosons
  • 5 篇 visualization
  • 5 篇 graph theory
  • 5 篇 artificial intel...
  • 5 篇 computer network...
  • 4 篇 conferences
  • 4 篇 data mining
  • 4 篇 wireless sensor ...
  • 4 篇 databases
  • 4 篇 algorithm design...
  • 4 篇 protocols
  • 4 篇 germanium alloys
  • 4 篇 clustering algor...
  • 4 篇 hardware
  • 4 篇 data visualizati...
  • 4 篇 mathematical mod...
  • 4 篇 cryptography

机构

  • 27 篇 faculté des scie...
  • 27 篇 department of ph...
  • 27 篇 graduate school ...
  • 27 篇 department of ph...
  • 27 篇 faculty of scien...
  • 27 篇 division of phys...
  • 27 篇 departamento de ...
  • 27 篇 department of ph...
  • 27 篇 department for p...
  • 27 篇 department of ph...
  • 27 篇 yerevan physics ...
  • 27 篇 infn sezione di ...
  • 27 篇 kirchhoff-instit...
  • 27 篇 fakultät für phy...
  • 27 篇 department of ph...
  • 27 篇 institute of phy...
  • 27 篇 institute of phy...
  • 27 篇 dsm/irfu cea sac...
  • 27 篇 physikalisches i...
  • 27 篇 instituto de fís...

作者

  • 32 篇 f. pastore
  • 31 篇 c. alexa
  • 31 篇 j. m. izen
  • 31 篇 a. harvey
  • 31 篇 c. hensel
  • 31 篇 s. michal
  • 31 篇 t. poghosyan
  • 31 篇 k. bos
  • 31 篇 g. bella
  • 31 篇 j. strandberg
  • 31 篇 d. calvet
  • 31 篇 c. amelung
  • 31 篇 b. toggerson
  • 31 篇 g. m. kolachev
  • 31 篇 c. geweniger
  • 31 篇 h. a. gordon
  • 31 篇 s. montesano
  • 31 篇 g. spigo
  • 31 篇 f. siegert
  • 31 篇 a. ishikawa

语言

  • 323 篇 英文
  • 4 篇 其他
  • 1 篇 中文
检索条件"机构=Inst. of Computer Science and Applied Mathematics"
328 条 记 录,以下是1-10 订阅
排序:
Integration of NGS Genomic Metadata Analysis with Open-Source Genomic Databases for Single Cell Tissue Samples
Integration of NGS Genomic Metadata Analysis with Open-Sourc...
收藏 引用
International Conference on Computational Cybernetics (ICCC)
作者: Marianna Dimitrova Kucarov Béla Molnár Miklos Kozlovszky 3DHistech Ltd. Doctoral School of Applied Informatics and Applied Mathematics BioTech Óbuda University Budapest Hungary 3DHistech Ltd. Budapest Hungary John von Neumann Faculty of Informatics Óbuda University Hun Medical Device Research Group LPDS Inst. for Computer Science and Control (SZTAKI) Hungarian Research Network (HUN-REN)
In this paper, we present the development and use of an automated platform that integrates the evaluation of genomic metadata from single-cells in colorectal tissues with the open source KEGG genomic database via API ... 详细信息
来源: 评论
Power-fractional distributions and branching processes
arXiv
收藏 引用
arXiv 2025年
作者: Alsmeyer, Gerold Hoang, Viet Hung Inst. Math. Stochastics Department of Mathematics and Computer Science University of Münster Orléans-Ring 10 MünsterD-48149 Germany Faculty of Fundamental Science Industrial University of Ho Chi Minh City No. 12 Nguyen Van Bao Ward 4 Go Vap District Ho Chi Minh City Viet Nam
In branching process theory, linear-fractional distributions are commonly used to model individual reproduction, especially when the goal is to obtain more explicit formulas than those derived under general model assu... 详细信息
来源: 评论
Optimization of a micro fluidic component using a parallel evolutionary algorithm and simulation based on discrete element methods
Optimization of a micro fluidic component using a parallel e...
收藏 引用
Sixth International Conference on computer Aided Optimum Design of Structures - OPTI 2001
作者: Jakob, W. Quinte, A. Scherer, K.-P. Eggert, H. Inst. for Applied Computer Science Forschungszentrum Karlsruhe Germany
In most cases, application of the powerful evolutionary optimizing method is limited to tasks which can manage with short simulation runtimes, e.g. less than one minute. More precise simulations like discrete element ... 详细信息
来源: 评论
Monotone circuits for connectivity require super-logarithmic depth  88
Monotone circuits for connectivity require super-logarithmic...
收藏 引用
20th Annual ACM Symposium on Theory of Computing, STOC 1988
作者: Karchmer, Mauricio Wigderson, Avi Inst. of Mathematics and Computer Science Hebrew University Jerusalem 91904 Israel
We prove that every monotone circuit which tests st-connectivity of an undirected graph on n nodes has depth Ω(log2n). This implies a superpolynomial (nOmega;(logn) lower bound on the size of any monotone formula for... 详细信息
来源: 评论
Binarization-free text line segmentation for historical documents based on interest point clustering
Binarization-free text line segmentation for historical docu...
收藏 引用
10th IAPR International Workshop on Document Analysis Systems, DAS 2012
作者: Garz, Angelika Fischer, Andreas Sablatnig, Robert Bunke, Horst Computer Vision Lab. Vienna Univ. of Technology 1040 Vienna Austria Inst. of Computer Science and Applied Mathematics 3012 Bern Switzerland
Segmenting page images into text lines is a crucial pre-processing step for automated reading of historical documents. Challenging issues in this open research field are given e.g. by paper or parchment background noi... 详细信息
来源: 评论
Partial solution to "image deblurring: I can see clearly now"
收藏 引用
Computing in science and Engineering 2003年 第4期5卷 72-74页
作者: Nagy, James G. O'Leary, Dianne P. Sagduyu, Yalin E. Mathematics Department Emory University Atlanta GA United States Applied Mathematics Program Inst. for Advanced Computer Studies University of Maryland College Park MD 20742 United States
The article discusses the partial solution to image deblurring. In this problem, the best way to choose the regularization parameter is by eye. Some nonlinear reconstruction algorithms that reduce the problem are also... 详细信息
来源: 评论
Hypergraph systems generating graph languages  2nd
Hypergraph systems generating graph languages
收藏 引用
2nd International Workshop on graph grammars and their applications to computer science, 1982
作者: Janssens, D. Rozenberg, G. Department of Mathematics University of Antwerp UIA Universiteitsplein 1 WilrijkB-2610 Belgium Inst. of Applied Mathematics and Computer Science University of Leiden Wassenaarseweg 80 Leiden Netherlands
来源: 评论
Generalization Error of Randomized Linear Zero Empirical Error Classifier: Simple Asymptotics for Centered Data Case
收藏 引用
Informatica 2000年 第4期11卷 381-396页
作者: Dičiunas, Valdas Raudys, Šarunas Department of Computer Science Vilnius University 2600 Vilnius Naugarduko 24 Lithuania Inst. of Mathematics and Informatics 2600 Vilnius Akademijos 4 Lithuania Inst. of Mathematics and Informatics Vilnius Lithuania
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estimate the generalization error (mean exp... 详细信息
来源: 评论
About direct methods
About direct methods
收藏 引用
International Workshop on Vision Algorithms: Theory and Practice, 1999
作者: Irani, M. Anandan, P. Dept. of Computer Science and Applied Mathematics The Weizmann Inst. of Science Rehovot Israel Microsoft Research One Microsoft Way RedmondWA98052 United States
This report provides a brief summary of the review of “Direct Methods”, which was presented by Michal Irani and P. Anandan.
来源: 评论
Distance constrained labelings of graphs of bounded treewidth
Distance constrained labelings of graphs of bounded treewidt...
收藏 引用
32nd International Colloquium on Automata, Languages and Programming, ICALP 2005
作者: Fiala, Jǐí Golovach, Petr A. Kratochvíl, Jan Inst. for Theoretical Computer Science Dept. of Applied Mathematics Charles University Prague Czech Republic Matematicheskii Fakultet Syktyvkar State University Syktyvkar Russia
We prove that the L(2,1)-LABELING problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one... 详细信息
来源: 评论