咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
Median filtering detection using LBP encoding pattern
收藏 引用
MULTIMEDIA TOOLS AND APPLICATIONS 2021年 第12期80卷 17721-17744页
作者: Wang, Xiaofeng Li, Xinai Tang, Chao Hu, Shaolin Xian Univ Technol Sch Sci Xian 710048 Shaanxi Peoples R China Guangdong Univ Petrochem Technol Maoming Guangdong Peoples R China
In recent years, median filtering detection has a widely application in many fields such as images' processing history tracking, image editing detection, image anti-forensics analyzing and anti-steganalysis analyz... 详细信息
来源: 评论
A polynomial algorithm for recognizing the Am-order class
收藏 引用
DISCRETE MATHEMATICS 2009年 第12期309卷 4200-4204页
作者: Moukrim, Aziz Sanlaville, Eric Univ Technol Compiegne CNRS Ctr Rech Royallieu HeuDiaSyC UMR 6599 F-60205 Compiegne France Univ Havre LITIS EA 4108 F-76058 Le Havre France
Recently new classes of directed, acyclic graphs with n vertices, namely A(m)-orders where m is a larger than I integer, have been presented. These classes contain the interval orders, but are incomparable to trees. H... 详细信息
来源: 评论
recognition of some perfectly orderable graph classes
收藏 引用
DISCRETE APPLIED MATHEMATICS 2003年 第2-3期128卷 355-373页
作者: Eschen, EM Johnson, JL Spinrad, JP Sritharan, R W Virginia Univ Lane Dept Comp Sci & Elect Engn Morgantown WV 26506 USA Vanderbilt Univ Dept Comp Sci Nashville TN 37235 USA Univ Dayton Dept Comp Sci Dayton OH 45469 USA
This paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P-4-simplicial graphs are recognized in O(n(3.376)) time, improving the previous bounds of O(n(4)) an... 详细信息
来源: 评论
On cube-free median graphs
收藏 引用
DISCRETE MATHEMATICS 2007年 第3-5期307卷 345-351页
作者: Bresar, Bostjan Klavzar, Sandi Skrekovski, Riste Univ Maribor FEECS Maribor 2000 Slovenia Univ Maribor Dept Math & Comp Sci Maribor 2000 Slovenia Univ Ljubljana Dept Math Ljubljana 1111 Slovenia Charles Univ Prague Fac Math & Phys DIMATIA Prague 11800 Czech Republic Inst Theoret Comp Sci Prague 11800 Czech Republic
Let G be a cube-free median graph. It is proved that k/2 >= root n-1 >= m/2 root n- >= root n >= root s >= r-1, where n, m, s, k, and r are the number of vertices, edges, squares, Theta-classes, and the... 详细信息
来源: 评论
Cough sound analysis to assess air quality in commercial weaner barns
收藏 引用
COMPUTERS AND ELECTRONICS IN AGRICULTURE 2019年 160卷 8-13页
作者: Wang, Xiaoshuai Zhao, Xiaoyang He, Yong Wang, Kaiying Zhejiang Univ Coll Biosyst Engn & Food Sci Hangzhou 310058 Zhejiang Peoples R China
The respiratory health and comfort of animals are closely associated with the air quality of their living environment. The aim of the present work is to identify the relationship between animal sounds and air quality ... 详细信息
来源: 评论
A linear-time certifying algorithm for recognizing generalized series-parallel graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 325卷 152-171页
作者: Chin, Francis Y. L. Ting, Hing-Fung Tsin, Yung H. Zhang, Yong Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Univ Windsor Sch Comp Sci Windsor ON N9B 3P4 Canada Chinese Acad Sci Shenzhen Inst Adv Technol Beijing Peoples R China
The problems of recognizing series-parallel graphs, outerplanar graphs, and generalized series-parallel graphs have been studied separately in the past. Efficient algorithms have been presented. However, none of the a... 详细信息
来源: 评论
Fuzzy context-free languages - Part 2: recognition and parsing algorithms
收藏 引用
THEORETICAL COMPUTER SCIENCE 2005年 第1-2期347卷 191-213页
作者: Asveld, PRJ Twente Univ Technol Dept Comp Sci NL-7500 AE Enschede Netherlands
In a companion paper [P.R.J. Asveld, Fuzzy context-free languages-Part 1: Generalized fuzzy context-free grammars, Theoret. Comput. Sci. (2005)] we used fuzzy context-free grammars in order to model grammatical errors... 详细信息
来源: 评论
Recognizing i-triangulated graphs in O(mn) time
收藏 引用
INFORMATION PROCESSING LETTERS 2000年 第3期76卷 141-147页
作者: Roussel, F Rusu, I Univ Orleans LIFO F-45067 Orleans 2 France
We use breadth-first search and contractions of subgraphs to give a new and faster algorithm to recognize i-triangulated graphs. (C) 2000 Elsevier Science B.V. All rights reserved.
来源: 评论
Recognizing k-path graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2000年 第1-3期99卷 169-181页
作者: Prisner, E Univ Hamburg Math Seminar D-20146 Hamburg Germany
The k-path graph P-k(H) Of a graph H has all length-k paths of H as vertices;two such vertices are adjacent in the new graph if their union forms a path or cycle of length k + 1 in H, and if the common edges of both p... 详细信息
来源: 评论
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
收藏 引用
DISCRETE APPLIED MATHEMATICS 2020年 279卷 154-167页
作者: Takaoka, Asahi Kanagawa Univ Dept Informat Syst Creat Kanagawa Ku Rokkakubashi 3-27-1 Yokohama Kanagawa 2218686 Japan
A simple-triangle graph (also known as a PI graph) is the intersection graph of a family of triangles defined by a point on a horizontal line and an interval on another horizontal line. The recognition problem for sim... 详细信息
来源: 评论