咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是101-110 订阅
排序:
Orientable edge colorings of graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2011年 第7期159卷 595-604页
作者: Jamison, Robert E. Clemson Univ Clemson SC 29634 USA Univ Haifa IL-31999 Haifa Israel
An edge coloring of a graph is orientable if and only if it is possible to orient the edges of the graph so that the color of each edge is determined by the head of its corresponding oriented arc. The goals of this pa... 详细信息
来源: 评论
A mathematical programming approach for recognizing binet matrices
收藏 引用
OPTIMIZATION LETTERS 2024年 第6期18卷 1511-1532页
作者: Papalamprou, Konstantinos Pitsoulis, Leonidas Kotnyek, Balasz Aristotle Univ Thessaloniki Elect & Comp Engn Dept Thessaloniki Greece London Sch Econ Dept Operat Res London England
The development of an efficient and practical method to recognize matrices originating from generalized graphs, in the same way that network matrices are defined over directed graphs, remains an open question. In this... 详细信息
来源: 评论
A characterization of partial directed line graphs
收藏 引用
DISCRETE MATHEMATICS 2007年 第21期307卷 2598-2614页
作者: Apollonio, Nicola Franciosa, Paolo G. Univ Roma La Sapienza Dipartimento Stat Probabilita & Stat Applicate I-00185 Rome Italy
Can a directed graph be completed to a directed line graph? If possible, how many arcs must be added? In this paper we address the above questions characterizing partial directed line (PDL) graphs, i.e., partial subgr... 详细信息
来源: 评论
On graphs without a C4 or a diamond
收藏 引用
DISCRETE APPLIED MATHEMATICS 2011年 第7期159卷 581-587页
作者: Eschen, Elaine M. Hoang, Chinh T. Spinrad, Jeremy P. Sritharan, R. W Virginia Univ Lane Dept Comp Sci & Elect Engn Morgantown WV 26506 USA Wilfrid Laurier Univ Dept Phys & Comp Waterloo ON N2L 3C5 Canada Vanderbilt Univ Dept Elect Engn & Comp Sci Nashville TN 37235 USA Univ Dayton Dept Comp Sci Dayton OH 45469 USA
We consider the class of (C-4, diamond)-free graphs;graphs in this class do not contain a C-4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of m... 详细信息
来源: 评论
On the recognition of permuted Supnick and incomplete Monge matrices
收藏 引用
ACTA INFORMATICA 1996年 第6期33卷 559-569页
作者: Deineko, V Rudolf, R Woeginger, GJ GRAZ TECH UNIV INST MATHA-8010 GRAZAUSTRIA
Incomplete Monge matrices are a generalization of standard Monge matrices: the values of some entries are not specified and the Monge property only must hold for all specified entries. We derive several combinatorial ... 详细信息
来源: 评论
A Simpler Linear-Time recognition of Circular-Arc Graphs
收藏 引用
algorithmICA 2011年 第3期61卷 694-737页
作者: Kaplan, Haim Nussbaum, Yahav Tel Aviv Univ Blavatnik Sch Comp Sci IL-69978 Tel Aviv Israel
We give a linear-time recognition algorithm for circular-arc graphs based on the algorithm of Eschen and Spinrad (Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 128-137, 1993) a... 详细信息
来源: 评论
Household appliance recognition through a Bayes classification model
收藏 引用
SUSTAINABLE CITIES AND SOCIETY 2019年 46卷 101393-000页
作者: Yan, Da Jin, Yuan Sun, Hongsan Dong, Bing Ye, Zi Li, Zhaoxuan Yuan, Yanping Tsinghua Univ Sch Architecture Beijing Peoples R China Univ Texas San Antonio Dept Mech Engn San Antonio TX USA Southwest Jiaotong Univ Sch Mech Engn Chengdu Sichuan Peoples R China
With the acceleration of global warming and energy shortages, the smart grid has become the goal of power grid development, which makes intelligent household appliance control systems essential. To promote the integra... 详细信息
来源: 评论
POLYHEDRAL OBJECT recognition WITH SPARSE DATA IN SIMD PROCESSING MODE
收藏 引用
IMAGE AND VISION COMPUTING 1989年 第1期7卷 71-78页
作者: HOLDER, D BUXTON, H QUEEN MARY COLL DEPT COMP SCILONDON E1 4NSENGLAND
The method of Grimson, Lozano Pérez and others for the recognition of polyhedral objects with sparse data, has been developed and implemented on a distributed array processor, the AMT DAP 500, which operates in s... 详细信息
来源: 评论
algorithms for perfectly contractile graphs
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2005年 第3期19卷 553-574页
作者: Maffray, F Trotignon, N Imag Lab Grenoble CNRS Lab Leibniz F-38031 Grenoble France
We consider the class A of graphs that contain no odd hole, no antihole of length at least 5, and no prism ( a graph consisting of two disjoint triangles with three disjoint paths between them) and the class A' of... 详细信息
来源: 评论
Fault classifications of MV transmission lines connected to wind farms using non-intrusive fault monitoring techniques on HV utility side
收藏 引用
IET GENERATION TRANSMISSION & DISTRIBUTION 2020年 第26期14卷 6518-6525页
作者: Chang, Hsueh-Hsien Jinwen Univ Sci & Technol Dept Comp & Commun Engn New Taipei Taiwan
The fault classification of medium-voltage transmission lines consisting of wind farms connected to the high-voltage (HV) transmission networks is carried out using the power-spectrum-based hyperbolic S-transform (HST... 详细信息
来源: 评论