机构

• 计算技术研究所 [2]
• 长春光学精密机械与物... [1]
• 自动化研究所 [1]
• 软件研究所 [1]

采集方式

• OAI收割 [5]

内容类型

• 期刊论文 [3]
• 会议论文 [2]

发表日期

• 2024 [1]
• 2018 [1]
• 2016 [1]
• 2005 [1]
• 2003 [1]

学科主题

筛选

浏览/检索结果: 共5条，第1-5条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序作者升序作者降序 Unified Dense Subgraph Detection: Fast Spectral Theory Based Algorithms 期刊论文  OAI收割 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 卷号: 36, 期号: 3, 页码: 1356-1370 作者:  Feng, Wenjie;  Liu, Shenghua;  Koutra, Danai;  Cheng, Xueqi   |  收藏  |  浏览/下载：31/0  |  提交时间：2024/05/20 Approximation algorithms  Image edge detection  Heuristic algorithms  Greedy algorithms  Optimization  Collaboration  Task analysis  Algorithm  anomaly detection  dense subgraph  graph spectral theory  large graph mining   An improved density peaks clustering algorithm with fast finding cluster centers 期刊论文  OAI收割 KNOWLEDGE-BASED SYSTEMS, 2018, 卷号: 158, 页码: 65-74 作者:  Xu, Xiao;  Ding, Shifei;  Shi, Zhongzhi   |  收藏  |  浏览/下载：54/0  |  提交时间：2019/12/10 Density peaks clustering algorithm  Prescreening strategy  Large-scale data set  Decision graph  Computational complexity   A fast projected fixed-point algorithm for large graph matching 期刊论文  OAI收割 PATTERN RECOGNITION, 2016, 卷号: 60, 页码: 971-982 作者:  Lu, Yao;  Huang, Kaizhu;  Liu, Cheng-Lin   |  收藏  |  浏览/下载：45/0  |  提交时间：2016/12/26 Graph Matching  Projected Fixed-point  Large Graph Algorithm  Feature Correspondence  Point Matching   An algorithm for domain axiom plan recognition based on extended goal graph (EI CONFERENCE) 会议论文  OAI收割 International Conference on Machine Learning and Cybernetics, ICMLC 2005, August 18, 2005 - August 21, 2005, Guangzhou, China 作者:  Chen J. 收藏  |  浏览/下载：61/0  |  提交时间：2013/03/25 This paper introduces a novel algorithm for domain axiom plan recognition. Using a method of domain axiom inference expansion  the algorithm can reconstruct goal graph to extend and improve original algorithm to allow plan recognition with domain axiom. The algorithm based on goal graph needs no plan library  so it can't be suffered from the problems in the acquisition and hand-coding of large plan libraries. It also has no problem in searching the plan space of exponential size. 2005 IEEE.   two-dimensional common-centroid stack generation algorithms for analog vlsi 会议论文  OAI收割 5th International Conference on ASIC, Beijing, PEOPLES R CHINA, OCT 21-24, Liu R; Dong SQ; Hong XL; Long D; Gu J   |  收藏  |  浏览/下载：13/0  |  提交时间：2011/07/29 analog VLSI design  mismatch minimization  parasitic control  stack generation algorithm  symmetric Eulerian graph  symmetric Eulerian trail  transistor insertion  two dimensional common centroid stacks  two dimensional symmetry  very large scale integrat