咨询与建议

限定检索结果

文献类型

  • 42 篇 期刊文献
  • 22 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 37 篇 工学
    • 25 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 5 篇 软件工程
    • 4 篇 控制科学与工程
    • 3 篇 材料科学与工程(可...
    • 3 篇 信息与通信工程
    • 2 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 航空宇航科学与技...
    • 1 篇 生物医学工程(可授...
  • 29 篇 理学
    • 28 篇 数学
    • 1 篇 物理学
    • 1 篇 生物学
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学
    • 1 篇 作物学
  • 1 篇 医学
    • 1 篇 临床医学
  • 1 篇 艺术学
    • 1 篇 音乐与舞蹈学

主题

  • 65 篇 recognition algo...
  • 5 篇 sketch tools
  • 4 篇 sketch recogniti...
  • 4 篇 pen-based interf...
  • 4 篇 np-completeness
  • 3 篇 modular decompos...
  • 3 篇 detection
  • 3 篇 forbidden induce...
  • 3 篇 noise
  • 3 篇 graph powers
  • 3 篇 probability
  • 3 篇 graph roots
  • 2 篇 maximal biclique...
  • 2 篇 split graphs
  • 2 篇 coloring
  • 2 篇 algorithms
  • 2 篇 finite classical...
  • 2 篇 p-4-tidy graphs
  • 2 篇 chordless graphs
  • 2 篇 forbidden partia...

机构

  • 2 篇 ural fed univ ek...
  • 2 篇 univ utrecht ins...
  • 2 篇 wilfrid laurier ...
  • 2 篇 aristotle univ t...
  • 2 篇 swinburne univ t...
  • 2 篇 tech univ berlin...
  • 2 篇 vanderbilt univ ...
  • 2 篇 univ rostock fac...
  • 2 篇 univ metz lab in...
  • 2 篇 univ warwick war...
  • 2 篇 wilfrid laurier ...
  • 1 篇 indian inst tech...
  • 1 篇 univ pompeu fabr...
  • 1 篇 herta secur sl b...
  • 1 篇 dipartimento di ...
  • 1 篇 hunan univ coll ...
  • 1 篇 barcelona superc...
  • 1 篇 uwa dept math & ...
  • 1 篇 colorado state u...
  • 1 篇 stanford univ gr...

作者

  • 3 篇 spinrad j
  • 3 篇 di stefano gabri...
  • 3 篇 plimmer beryl
  • 3 篇 blagojevic rache...
  • 3 篇 praeger cheryl e...
  • 2 篇 safe martin d.
  • 2 篇 duran guillermo
  • 2 篇 adamaszek anna
  • 2 篇 chaplick steven
  • 2 篇 dourado mitre c.
  • 2 篇 dorosinskiy leon...
  • 2 篇 pitsoulis leonid...
  • 2 篇 brandstädt a
  • 2 篇 grippo luciano n...
  • 2 篇 grundy john
  • 2 篇 rao m
  • 2 篇 suen cy
  • 2 篇 myasnikov filipp
  • 2 篇 hoang chinh t.
  • 2 篇 bodlaender hl

语言

  • 52 篇 英文
  • 13 篇 其他
检索条件"主题词=recognition algorithms"
65 条 记 录,以下是21-30 订阅
排序:
***: A gesture recognizer developed using data mining
收藏 引用
AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2012年 第3期26卷 351-366页
作者: Chang, Samuel Hsiao-Heng Blagojevic, Rachel Plimmer, Beryl Univ Auckland Dept Comp Sci Auckland 1142 New Zealand
Although many approaches to digital ink recognition have been proposed, most lack the flexibility and adaptability to provide acceptable recognition rates across a variety of problem spaces. This project uses a system... 详细信息
来源: 评论
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
收藏 引用
DISCRETE APPLIED MATHEMATICS 2022年 321卷 179-219页
作者: Hellmuth, Marc Scholz, Guillaume E. Stockholm Univ Fac Sci Dept Math SE-10691 Stockholm Sweden Univ Leipzig Dept Comp Sci Bioinformat Grp Hartelstr 16-18 D-04107 Leipzig Germany Univ Leipzig Interdisciplinary Ctr Bioinforrnat Hartelstr 16-18 D-04107 Leipzig Germany
The modular decomposition of a graph G is a natural construction to capture key features of G in terms of a labeled tree (T, t) whose vertices are labeled as "series"(1), "parallel"(0) or "pri... 详细信息
来源: 评论
LARGE-GIRTH ROOTS OF GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2010年 第4期24卷 1501-1514页
作者: Adamaszek, Anna Adamaszek, Micha L. Univ Warwick Warwick Math Inst Coventry CV4 7AL W Midlands England Univ Warwick Ctr Discrete Math & Its Applicat DIMAP Coventry CV4 7AL W Midlands England
We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of g... 详细信息
来源: 评论
Recognizing Optimal 1-Planar Graphs in Linear Time
收藏 引用
ALGORITHMICA 2018年 第1期80卷 1-28页
作者: Brandenburg, Franz J. Univ Passau D-94030 Passau Germany
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of edges. We show that optimal 1-planar graphs can be recognized in... 详细信息
来源: 评论
Characterising (k, l)-leaf powers
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第2期158卷 110-122页
作者: Brandstaedt, Andreas Wagner, Peter Univ Rostock Inst Informat D-18051 Rostock Germany
We say that, for k >= 2 and l > k, a tree T with distance function d(T) (x, y) is a (k, l)-leaf root of a finite simple graph G = (V, E) if V is the set of leaves of T, for all edges xy is an element of E, d(T) ... 详细信息
来源: 评论
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2001年 第1-2期263卷 99-111页
作者: Damiand, G Habib, M Paul, C Univ Montpellier 2 LIRMM UMR CNRS F-34392 Montpellier 5 France Univ Bordeaux 1 LABRI F-33405 Talence France
An easy way for graph recognition algorithms is to use a two-step process: first, compute a characteristic feature as if the graph belongs to that class;second, check whether the computed feature really defines the in... 详细信息
来源: 评论
On the generalized Helly property of hypergraphs, cliques, and bicliques
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期330卷 56-77页
作者: Dourado, Mitre C. Grippo, Luciano N. Safe, Martin D. Univ Fed Rio de Janeiro Inst Comp Rio De Janeiro Brazil Univ Nacl Gen Sarmiento Inst Ciencias Los Polvorines Buenos Aires Argentina Consejo Nacl Invest Cient & Tecn Buenos Aires Argentina Univ Nacl Sur UNS Dept Matemat Bahia Blanca Argentina Univ Nacl Sur UNS INMABB CONICET Bahia Blanca Argentina Dept Matemat Ave Alem 1253 Piso 2 RA-8000 Bahia Blanca Argentina
A family of sets is (p, q) -intersecting if every nonempty subfamily of p or fewer sets has at least q elements in its total intersection. A family of sets has the (p, q)-Helly property if every nonempty (p, q)-inters... 详细信息
来源: 评论
Secondary learning in the assembly neural network
收藏 引用
NEUROCOMPUTING 2004年 第12期62卷 405-426页
作者: Goltsev, A Ukrainian Acad Sci VM Glushkov Cybernet Ctr Dept Neural Informat Proc Syst UA-03680 Kiev Ukraine
A neural network with assembly organization is described, The network is artificially partitioned into several sub-networks according to the number of classes that the network has to recognize. The features extracted ... 详细信息
来源: 评论
Using data mining for digital ink recognition: Dividing text and shapes in sketched diagrams
收藏 引用
COMPUTERS & GRAPHICS-UK 2011年 第5期35卷 976-991页
作者: Blagojevic, Rachel Plimmer, Beryl Grundy, John Wang, Yong Univ Auckland Auckland 1 New Zealand Swinburne Univ Technol Hawthorn Vic 3122 Australia
The low accuracy rates of text-shape dividers for digital ink diagrams are hindering their use in real world applications. While recognition of handwriting is well advanced and there have been many recognition approac... 详细信息
来源: 评论
On the complexity of recognizing directed path families
收藏 引用
DISCRETE APPLIED MATHEMATICS 2009年 第11期157卷 2525-2535页
作者: Apollonio, N. Frandosa, P. G. Univ Roma La Sapienza Dipartimento Stat Probabil & Stat Applicate I-00185 Rome Italy
A Directed Path Family is a family of subsets of some finite ground set whose members call be realized as arc sets of simple directed paths in some directed graph. In this paper we show that recognizing whether a give... 详细信息
来源: 评论