QQ客服 官方微博 反馈留言

	Novel robust and self-adaptive road following algorithm based on graph cuts and clustering
	Zhou, Wenhui[1,3]; Lin, Lili[2]; Wu, Eryong[1]
	2009
卷号	30期号:11页码:2366
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5875441
专题	浙江工商大学
作者单位	1.[1] College of Computer Science, Hangzhou Dianzi University, Hangzhou 310018, China 2.[2] College of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou 310035, China 3.[3] Zhejiang Provincial Key Laboratory of Information Network Technology, Zhejiang University, Hangzhou 310013, China
推荐引用方式 GB/T 7714	Zhou, Wenhui[1,3],Lin, Lili[2],Wu, Eryong[1]. Novel robust and self-adaptive road following algorithm based on graph cuts and clustering[J],2009,30(11):2366.
APA	Zhou, Wenhui[1,3],Lin, Lili[2],&Wu, Eryong[1].(2009).Novel robust and self-adaptive road following algorithm based on graph cuts and clustering.,30(11),2366.
MLA	Zhou, Wenhui[1,3],et al."Novel robust and self-adaptive road following algorithm based on graph cuts and clustering".30.11(2009):2366.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。