咨询与建议

限定检索结果

文献类型

  • 87 篇 期刊文献
  • 23 篇 会议
  • 15 册 图书
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 105 篇 工学
    • 52 篇 计算机科学与技术...
    • 46 篇 航空宇航科学与技...
    • 23 篇 软件工程
    • 18 篇 仪器科学与技术
    • 3 篇 机械工程
    • 3 篇 控制科学与工程
    • 3 篇 核科学与技术
    • 2 篇 电气工程
    • 2 篇 测绘科学与技术
    • 1 篇 力学(可授工学、理...
    • 1 篇 动力工程及工程热...
    • 1 篇 电子科学与技术(可...
    • 1 篇 地质资源与地质工...
    • 1 篇 兵器科学与技术
    • 1 篇 环境科学与工程(可...
  • 40 篇 理学
    • 37 篇 数学
    • 1 篇 物理学
    • 1 篇 系统科学
    • 1 篇 科学技术史(分学科...
    • 1 篇 生态学
    • 1 篇 统计学(可授理学、...
  • 22 篇 管理学
    • 22 篇 管理科学与工程(可...
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 历史学
    • 1 篇 世界史
  • 1 篇 医学
    • 1 篇 临床医学
  • 1 篇 军事学
    • 1 篇 军队指挥学

主题

  • 122 篇 algorithms and d...
  • 20 篇 computing and in...
  • 15 篇 computational fl...
  • 15 篇 computing, infor...
  • 13 篇 signal processin...
  • 13 篇 optimization alg...
  • 12 篇 applied mathemat...
  • 12 篇 aerospace scienc...
  • 12 篇 data science
  • 11 篇 fluid dynamics
  • 11 篇 avionics compute...
  • 10 篇 computer program...
  • 10 篇 computational ge...
  • 10 篇 communication sy...
  • 10 篇 numerical analys...
  • 9 篇 planets
  • 9 篇 fluid flow prope...
  • 9 篇 structural engin...
  • 9 篇 aviation
  • 9 篇 control theory

机构

  • 5 篇 utah state univ ...
  • 3 篇 cluster excellen...
  • 3 篇 max planck inst ...
  • 2 篇 royal holloway u...
  • 2 篇 natl univ def te...
  • 2 篇 univ bergen dept...
  • 2 篇 inst math sci ch...
  • 2 篇 univ bonn dept c...
  • 2 篇 vienna univ tech...
  • 2 篇 univ bordeaux 1 ...
  • 2 篇 tech univ munich...
  • 2 篇 mit dept math ca...
  • 2 篇 univ notre dame ...
  • 2 篇 kyushu univ dept...
  • 2 篇 inst math sci ma...
  • 2 篇 ben gurion univ ...
  • 2 篇 tsinghua univ sc...
  • 2 篇 kyushu univ grad...
  • 1 篇 complex syst eng...
  • 1 篇 ctr natl etud sp...

作者

  • 6 篇 ramanujan m. s.
  • 5 篇 mnich matthias
  • 5 篇 wang haitao
  • 5 篇 saurabh saket
  • 4 篇 schmidt jens m.
  • 2 篇 duchon philippe
  • 2 篇 hanusse nicolas
  • 2 篇 higa yasuto
  • 2 篇 takeda masayuki
  • 2 篇 maass mg
  • 2 篇 zhang jingru
  • 2 篇 zemmari akka
  • 2 篇 inenaga shunsuke
  • 2 篇 hermelin danny
  • 2 篇 chen danny z.
  • 2 篇 saheb nasser
  • 2 篇 van leeuwen erik...
  • 2 篇 gaspers serge
  • 2 篇 jones mark
  • 2 篇 schmid andreas

语言

  • 121 篇 英文
  • 3 篇 其他
  • 2 篇 中文
  • 1 篇 葡萄牙文
检索条件"主题词=Algorithms and Data Structures"
127 条 记 录,以下是61-70 订阅
排序:
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzik bound
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2014年 第7期80卷 1384-1403页
作者: Mnich, Matthias Philip, Geevarghese Saurabh, Saket Suchy, Ondrej Max Planck Inst Informat D-66123 Saarbrucken Germany Inst Math Sci Chennai 600113 Tamil Nadu India Czech Tech Univ CR-16635 Prague Czech Republic
We define strong lambda-extendibility as a variant of the notion of lambda-extendible properties of graphs (Poljak and Turzik, Discrete Mathematics, 1986). We show that the parameterized APT(Pi) problem - given a conn... 详细信息
来源: 评论
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
收藏 引用
ALGORITHMICA 2014年 第3期70卷 513-560页
作者: Hermelin, Danny Mnich, Matthias van Leeuwen, Erik Jan Ben Gurion Univ Negev IL-84105 Beer Sheva Israel Cluster Excellence MMCI D-66123 Saarbrucken Germany Max Planck Inst Informat D-66123 Saarbrucken Germany
The Induced Graph Matching problem asks to find disjoint induced subgraphs isomorphic to a given graph in a given graph such that there are no edges between vertices of different subgraphs. This problem generalizes th... 详细信息
来源: 评论
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
Parameterized Complexity of Induced Graph Matching on Claw-F...
收藏 引用
20th Annual European Symposium on algorithms (ESA)
作者: Hermelin, Danny Mnich, Matthias van Leeuwen, Erik Jan Ben Gurion Univ Negev IL-84105 Beer Sheva Israel Cluster Excellence MMCI D-66123 Saarbrucken Germany Max Planck Inst Informat D-66123 Saarbrucken Germany
The Induced Graph Matching problem asks to find disjoint induced subgraphs isomorphic to a given graph in a given graph such that there are no edges between vertices of different subgraphs. This problem generalizes th... 详细信息
来源: 评论
Computational Intelligence in Aerospace Sciences
收藏 引用
丛书名: Progress in Astronautics and Aeronautics
2014年
作者: Massimiliano Vasile Victor M. Becerra
In the aerospace sciences, computational intelligence techniques are now key tools in addressing many problems. Such techniques have progressed along with increases in computing power, allowing numerical simulation to... 详细信息
来源: 评论
Factoring Sparse Bivariate Polynomials Using the Priority Queue
Factoring Sparse Bivariate Polynomials Using the Priority Qu...
收藏 引用
16th International Workshop on Computer Algebra in Scientific Computing (CASC)
作者: Abu Salem, Fatima K. El-Harake, Khalil Gemayel, Karl Amer Univ Beirut Dept Comp Sci Beirut Lebanon Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA USA
We revisit the polytope method for factoring sparse bivariate polynomials over finite fields, and address the bottleneck arising from solving the Hensel lifting equations using the sparse distributed polynomial repres... 详细信息
来源: 评论
Optimal eviction policies for stochastic address traces
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 514卷 36-60页
作者: Bilardi, Gianfranco Versaci, Francesco Univ Padua Dept Informat Engn I-35100 Padua Italy
The eviction problem for memory hierarchies is studied for the Hidden Markov Reference Model (HMRM) of the memory trace, showing how miss minimization can be naturally formulated in the optimal control setting. In add... 详细信息
来源: 评论
Spectral Sparsification in the Semi-streaming Setting
收藏 引用
THEORY OF COMPUTING SYSTEMS 2013年 第2期53卷 243-262页
作者: Kelner, Jonathan A. Levin, Alex MIT Dept Math Cambridge MA 02139 USA
Let G be a graph with n vertices and m edges. A sparsifier of G is a sparse graph on the same vertex set approximating G in some natural way. It allows us to say useful things about G while considering much fewer than... 详细信息
来源: 评论
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions
收藏 引用
ALGORITHMICA 2013年 第2期66卷 310-328页
作者: Pestov, Vladimir Univ Ottawa Dept Math & Stat Ottawa ON K1N 6N5 Canada
Within a mathematically rigorous model, we analyse the curse of dimensionality for deterministic exact similarity search in the context of popular indexing schemes: metric trees. The datasets X are sampled randomly fr... 详细信息
来源: 评论
Feedback Vertex Sets in Tournaments
收藏 引用
JOURNAL OF GRAPH THEORY 2013年 第1期72卷 72-89页
作者: Gaspers, Serge Mnich, Matthias Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria Tech Univ Eindhoven NL-5600 MB Eindhoven Netherlands
We study combinatorial and algorithmic questions around minimal feedback vertex sets (FVS) in tournament graphs. On the combinatorial side, we derive upper and lower bounds on the maximum number of minimal FVSs in an ... 详细信息
来源: 评论
Construction Sequences and Certifying 3-connectivity
收藏 引用
ALGORITHMICA 2012年 第1-2期62卷 192-208页
作者: Schmidt, Jens M. Free Univ Berlin Dept Comp Sci Berlin Germany
Tutte proved that every 3-vertex-connected graph G on more than 4 vertices has a contractible edge. Barnette and Grunbaum proved the existence of a removable edge in the same setting. We show that the sequence of cont... 详细信息
来源: 评论