咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是71-80 订阅
Recognizing DNA graphs is difficult
收藏 引用
DISCRETE APPLIED MATHEMATICS 2003年 第1期127卷 85-94页
作者: Pendavingh, R Schuurman, P Woeginger, GJ Univ Twente Dept Math NL-7500 AE Enschede Netherlands Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands Graz Tech Univ Inst Math A-8010 Graz Austria
DNA graphs are the vertex induced subgraphs of De Bruijn graphs over a four letter alphabet. In this paper, we prove the NP-hardness of various recognition problems for subgraphs of De Bruijn graphs;in particular, the... 详细信息
来源: 评论
Exploration of head gesture control for hearing instruments
收藏 引用
INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2014年 第4期16卷 240-249页
作者: Tessendorf, Bernd Gravenhorst, Franz Roggen, Daniel Stiefmeier, Thomas Strohrmann, Christina Troester, Gerhard Derleth, Peter Feilner, Manuela ETH Wearable Comp Lab CH-8092 Zurich Switzerland Phonak AG CH-8712 Stafa Switzerland
In this work, we investigated the benefit of head gestures as a user interface to control hearing instruments (HIs). We developed a prototype of a head-gesture-controlled HI, which was based on a customised wireless a... 详细信息
来源: 评论
algorithms for square-3PC(.,.)-free berge graphs
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2008年 第1期22卷 51-71页
作者: Maffray, Frederic Trotignon, Nicolas Vuskovic, Kristina CNRS Lab GSCOP F-38031 Grenoble France Univ Paris 01 Ctr Econ Sorbonne F-75647 Paris 13 France Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths induce a hole, and at least two of the paths are... 详细信息
来源: 评论
Design of computer interactive system for sports training based on artificial intelligence and improved support vector
收藏 引用
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2019年 第5期37卷 6165-6175页
作者: Kong, Fei Wang, Yumin Qingdao Univ Sch Electromechan Engn Dept Ind Design Qingdao Shandong Peoples R China Qingdao Univ Technol Sch Sci Qingdao Shandong Peoples R China
At present, there is less software related to sport technical behavior recognition, and there are few studies on the classification and identification of detailed actions. By introducing computer technology to analyze... 详细信息
来源: 评论
Detecting even holes
收藏 引用
JOURNAL OF GRAPH THEORY 2005年 第2期48卷 85-111页
作者: Chudnovsky, M Kawarabayashi, K Seymour, P Princeton Univ Dept Math Princeton NJ 08544 USA Tohoku Univ Grad Sch Informat Sci Miyagi 9808579 Japan
Conforti, Cornuejols, Kapoor, and Vuskovic (Even-hole-free graphs. Part II: recognition algorithm, J Graph Theory 40 (2002), 238-266) gave a 73-page polynomial time algorithm to test whether a graph has an induced sub... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论