咨询与建议

限定检索结果

文献类型

  • 131 篇 期刊文献
  • 66 篇 会议
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 126 篇 工学
    • 72 篇 计算机科学与技术...
    • 34 篇 电气工程
    • 25 篇 软件工程
    • 24 篇 控制科学与工程
    • 13 篇 信息与通信工程
    • 8 篇 仪器科学与技术
    • 8 篇 电子科学与技术(可...
    • 7 篇 石油与天然气工程
    • 6 篇 机械工程
    • 3 篇 光学工程
    • 3 篇 农业工程
    • 2 篇 材料科学与工程(可...
    • 2 篇 环境科学与工程(可...
  • 102 篇 理学
    • 83 篇 数学
    • 6 篇 物理学
    • 6 篇 生物学
    • 4 篇 天文学
    • 3 篇 化学
    • 3 篇 统计学(可授理学、...
    • 2 篇 地球物理学
    • 2 篇 系统科学
  • 27 篇 管理学
    • 23 篇 管理科学与工程(可...
    • 2 篇 工商管理
    • 2 篇 公共管理
    • 2 篇 图书情报与档案管...
  • 7 篇 农学
    • 4 篇 作物学
  • 5 篇 医学
    • 3 篇 临床医学
    • 2 篇 基础医学(可授医学...
  • 2 篇 文学
  • 2 篇 艺术学
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 198 篇 recognition algo...
  • 10 篇 decomposition
  • 6 篇 artificial intel...
  • 5 篇 wavelet transfor...
  • 5 篇 system theory
  • 5 篇 feature extracti...
  • 5 篇 characterization
  • 5 篇 operating system
  • 4 篇 deep learning
  • 4 篇 forbidden subgra...
  • 4 篇 computer vision
  • 4 篇 object recogniti...
  • 3 篇 phylogenetics
  • 3 篇 graph
  • 3 篇 recognition rate
  • 3 篇 2-join
  • 3 篇 labeled trees
  • 3 篇 perfect graphs
  • 3 篇 fibonacci cube
  • 3 篇 np-completeness

机构

  • 7 篇 univ dayton dept...
  • 6 篇 w virginia univ ...
  • 5 篇 max planck inst ...
  • 4 篇 santa fe inst 13...
  • 4 篇 univ leipzig int...
  • 4 篇 univ leipzig dep...
  • 4 篇 univ leeds sch c...
  • 4 篇 univ vienna inst...
  • 3 篇 saarland univ ct...
  • 3 篇 wilfrid laurier ...
  • 3 篇 univ padua dipar...
  • 3 篇 univ nacl colomb...
  • 3 篇 faculty of infor...
  • 2 篇 ernst moritz arn...
  • 2 篇 univ maribor fac...
  • 2 篇 xian univ techno...
  • 2 篇 univ leipzig dep...
  • 2 篇 univ waterloo de...
  • 2 篇 univ waterloo de...
  • 2 篇 univ ljubljana f...

作者

  • 8 篇 hellmuth marc
  • 6 篇 stadler peter f.
  • 5 篇 conforti m
  • 4 篇 vuskovic kristin...
  • 4 篇 cornuéjols g
  • 4 篇 zambelli g
  • 4 篇 sritharan r.
  • 4 篇 vuskovic k
  • 3 篇 vesel aleksander
  • 3 篇 wieseke nicolas
  • 3 篇 taranenko andrej
  • 3 篇 seemann carsten ...
  • 3 篇 takaoka asahi
  • 3 篇 sritharan r
  • 3 篇 zmazek b
  • 3 篇 gianfelici franc...
  • 3 篇 turchetti claudi...
  • 3 篇 zhankai li
  • 3 篇 schaudt oliver
  • 3 篇 zerovnik j

语言

  • 173 篇 英文
  • 23 篇 其他
  • 2 篇 中文
检索条件"主题词=Recognition algorithm"
198 条 记 录,以下是61-70 订阅
排序:
Precision of recognition algorithms for evaluating a single class of tables
收藏 引用
Cybernetics 1974年 第3期10卷 405-411页
作者: Terenkov, V.I.
来源: 评论
Minimization of boolean functions and effective recognition algorithms
收藏 引用
Cybernetics 1974年 第3期10卷 393-397页
作者: Gurevich, I.B. Zhuravlev, Yu.I.
来源: 评论
PARALLEL recognition algorithmS FOR GRAPHS WITH RESTRICTED NEIGHBOURHOODS
收藏 引用
International Journal of Foundations of Computer Science 1990年 第2期1卷 123-130页
作者: SERGIO DE AGOSTINO ROSSELLA PETRESCHI Department of Mathematics University “La Sapienza” Piazzale Aldo Moro 2 00185 Rome Italy
In this paper three parallel recognition algorithms for threshold, matrogenic and box-threshold graphs, respectively, are given. These classes of graphs are inclusionwise comparable and depend only on their degree seq... 详细信息
来源: 评论
A refined deep-learning-based algorithm for harmful-algal-bloom remote-sensing recognition using Noctiluca scintillans algal bloom as an example
收藏 引用
JOURNAL OF HAZARDOUS MATERIALS 2024年 467卷 133721页
作者: Liu, Rongjie Cui, Binge Dong, Wenwen Fang, Xi Xiao, Yanfang Zhao, Xin Cui, Tingwei Ma, Yi Wang, Quanbin Minist Nat Resources Inst Oceanog 1 Qingdao 266061 Peoples R China Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Peoples R China Sun Yat Sen Univ Sch Atmospher Sci Southern Marine Sci & Engn Guangdong Lab Zhuhai Zhuhai 519082 Peoples R China Minist Educ Key Lab Trop Atmosphere Ocean Syst Zhuhai 519082 Peoples R China
Harmful algal blooms (HABs) are challenging to recognize because of their striped and uneven biomass distributions. To address this issue, a refined deep -learning algorithm termed HAB-Ne was developed for the recogni... 详细信息
来源: 评论
Multi-state autonomous drilling for lunar exploration
收藏 引用
Chinese Journal of Aeronautics 2016年 第5期29卷 1397-1404页
作者: Chen Chongbin Quan Qiquan Shi Xiaomeng Deng Zongquan Tang Dewei Jiang Shengyuan State Key Laboratory of Robotics and System Harbin Institute of Technology
Due to the lack of information of subsurface lunar regolith stratification which varies along depth, the drilling device may encounter lunar soil and lunar rock randomly in the drilling process. To meet the load safet... 详细信息
来源: 评论
A non-probabilistic recognizer of stochastic signals based on KLT
收藏 引用
SIGNAL PROCESSING 2009年 第4期89卷 422-437页
作者: Gianfelici, Francesco Turchetti, Claudio Crippa, Paolo Univ Politecn Marche DIBET I-60131 Ancona Italy
This paper presents an efficient algorithm which is able to accurately recognize non-deterministic signals generated by synthetic non-chaotic and chaotic stochastic processes (SPs), as well as by natural phenomena (th... 详细信息
来源: 评论
Odd hole recognition in graphs of bounded clique size
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2006年 第1期20卷 42-48页
作者: Conforti, M Cornuéjols, G Liu, XM Vuskovic, K Zambelli, G Univ Padua Dipartimento Matemat Pura & Applicata I-35131 Padua Italy Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA Fac Sci Luminy LIF F-13288 Marseille France Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada
In a graph G, an odd hole is an induced odd cycle of length at least 5. A clique of G is a set of pairwise adjacent vertices. In this paper we consider the class C-k of graphs whose cliques have a size bounded by a co... 详细信息
来源: 评论
Linear orderings of subfamilies of AT-free graphs
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2006年 第1期20卷 105-118页
作者: Corneil, DG Köhler, E Olariu, S Stewart, L Univ Toronto Dept Comp Sci Toronto ON M55 3G4 Canada Tech Univ Berlin Inst Math D-10623 Berlin Germany Old Dominion Univ Dept Comp Sci Norfolk VA 23529 USA Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada
Asteroidal triple free (AT-free) graphs have been introduced as a generalization of interval graphs, since interval graphs are exactly the chordal AT-free graphs. While for interval graphs it is obvious that there is ... 详细信息
来源: 评论
Disjoint clique cutsets in graphs without long holes
收藏 引用
JOURNAL OF GRAPH THEORY 2005年 第4期48卷 277-298页
作者: Eschen, EM Hoàng, CT Petrick, MDT Sritharan, R W Virginia Univ Lane Dept Comp Sci & Elect Engn Morgantown WV 26506 USA Wilfrid Laurier Univ Dept Phys & Comp Sci Waterloo ON N2L 3C5 Canada Univ Waterloo Dept Comp Sci Waterloo ON N2L 3G1 Canada Univ Dayton Dept Comp Sci Dayton OH 45469 USA
A biclique cutset is a cutset that induces the disjoint union of two cliques. A hole is an induced cycle with at least five vertices. A graph is biclique separable if it has no holes and each induced subgraph that is ... 详细信息
来源: 评论
An algorithm for k-convex closure and an application
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2001年 第1期78卷 1-11页
作者: Pisanski, T Zmazek, B Zerovnik, J Univ Maribor Fac Mech Engn SLO-2000 Maribor Slovenia IMFM TCS Ljubljana Slovenia Univ Ljubljana Fac Math & Phys Ljubljana Slovenia Univ Maribor Dept Math SLO-2000 Maribor Slovenia
An algorithm for computing the k-convex closure of a subgraph relative to a given equivalence relation R among edges of a graph is given. For general graph and arbitrary relation R the time complexity is O(qn(2) + mn)... 详细信息
来源: 评论