咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 193 篇 recognition algo...
  • 10 篇 decomposition
  • 5 篇 wavelet transfor...
  • 5 篇 feature extracti...
  • 5 篇 characterization
  • 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
  • 2 篇 vision system
  • 2 篇 traveling salesm...
  • 2 篇 bounded subdeter...

机构

  • 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

语言

  • 168 篇 英文
  • 22 篇 其他
  • 2 篇 中文
检索条件"主题词=Recognition algorithm"
193 条 记 录,以下是101-110 订阅
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... 详细信息
来源: 评论
Signal recognition without State Space Expansion Based on Observations Containing a Singular Interference: The Case of Nonlinear Parameters of Basis Functions
收藏 引用
AUTOMATION AND REMOTE CONTROL 2024年 第2期85卷 147-161页
作者: Bulychev, Yu. G. JSC Concern Radioelect Technol Moscow Russia
This paper proposes a novel method for recognizing a set of signals with linearly and nonlinearly included parameters from a given ensemble of signals under essential a priori uncertainty. Due to this uncertainty, wel... 详细信息
来源: 评论
recognition of overlap graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2014年 第1期28卷 25-37页
作者: Gevezes, Theodoros P. Pitsoulis, Leonidas S. Aristotle Univ Thessaloniki Dept Math Phys & Computat Sci Thessaloniki 54124 Greece
Overlap graphs occur in computational biology and computer science, and have applications in genome sequencing, string compression, and machine scheduling. Given two strings and , their overlap string is defined as th... 详细信息
来源: 评论
Signed-graphic matroids with all-graphic cocircuits
收藏 引用
DISCRETE MATHEMATICS 2017年 第12期340卷 2889-2899页
作者: Papalamprou, Konstantinos Pitsoulis, Leonidas S. Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki 54124 Greece
A matroid M has all-graphic cocircuits if M\Y is a graphic matroid for every cocircuit Y is an element of C*(M). In Papalamprou and Pitsoulis (2013) it has been shown that signed-graphic matroids that are representabl... 详细信息
来源: 评论
GRAPH SANDWICH PROBLEMS
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 1995年 第3期19卷 449-473页
作者: GOLUMBIC, MC KAPLAN, H SHAMIR, R PRINCETON UNIV DEPT COMP SCI PRINCETON NJ 08544 USA TEL AVIV UNIV SACKLER FAC EXACT SCI DEPT COMP SCI IL-69978 TEL AVIV ISRAEL
The graph sandwich problem for property Pi: is defined as follows: Given two graphs G(1) = (V, E(1)) and G(2) = (V, E(2)) such that E(1) subset of or equal to E(2), is there a graph G = (V, E) such that E(1) subset of... 详细信息
来源: 评论
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs
收藏 引用
JOURNAL OF COMBINATORIAL THEORY SERIES B 2020年 143卷 123-147页
作者: Diot, Emilie Radovanovic, Marko Trotignon, Nicolas Vuskovic, Kristina ENS Lyon LIP Lyon France Univ Belgrade Fac Math Belgrade Serbia ENS Lyon CNRS LIP Lyon France Univ Leeds Sch Comp Leeds W Yorkshire England Union Univ Fac Comp Sci RAF Belgrade Serbia
Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition theorems for hereditary graph classes. In this paper, we ... 详细信息
来源: 评论