维普期刊资源整合服务平台（V6.5）

182篇 您的检索式：作者名="D M Mount"

选中清除导出查看参考文献查看引证文献引用追踪共10页首页上一页第1页下一页末页 /10 跳转

	题名	作者	年代	出处	被引量
1	An effi cient k--means clustering algorithm: Analysis and im plementation 显示文摘	Kanungo T Mount D M Netanyahu N	2002	IEEE Transactions on Pattern Analy sis and Machine Intelligence2002，24，7：	1
2	Approximation algorithm for the kinetic robust k center problem显示文摘	Friedler S A Mount D M	2010	Computational Geome- try2010，43，6：	1
3	An efficient K-means clustering algorithm: analysis and implementation 显示文摘	KANUNGO T MOUNT D M NETANYAHU N S	2002	IEEE Trans on Pattom Anal Maeh Intoll2002，24，7：	1
4	Calpain-regulated p35/ cdk5 plays a central role in dopaminergic neuron death through modulation of the transcription factor myocyte enhancer factor 2 显示文摘	Smith P D Mount M P Shree R	2006	J Neurosei2006，26，2：	1
5	A local search Approximation algo- rithm for k-means clustering显示文摘	Kanungo T Mount D M	2004	Computational Geometry2004，28，23：	1
6	An effi- cient k-means clustering algorithm: analysis and implementation 显示文摘	KANUNGO T MOUNT D M NETANYAHU N S	2000	IEEE Transactions on Pattern Analysis and Machine Intelli- gence2000，24，7：	1
7	Approximation algorithm for the kinetic robust K-center problem显示文摘	Friedler S A Mount D M	2010	Computational Geome- try2010，43，6：	1
8	The discrete geodesic problem显示文摘	MITCHELL J S B MOUNT D M PAPADIMITR- IOU C H	1987	SlAM Journal on Computing1987，16，4：	1
9	An efficient K-means clustering algorithm: analysis and implementation显示文摘	KANUNGO Tapas MOUNT D M	2002	IEEE Transactions on Pattern Analysis and Machine Intelligence2002，24，7：	1
10	An optimal algorithm for approximate nearest neighbor searching fixed dimensions显示文摘	ARYA S MOUNT D M		0，，06：	1
11	An efficient k-means clustering algorithm: analysis and implementation 显示文摘	Kanungo T Mount D M Netanyahu N S	2002	IEEE Transactions on Pattern Analysis and Machine Intelligence2002，24，7：	1
12	An efficient k-means clustering algorithm:Analysis and implementation显示文摘	Kanungo T Mount D M Netanyahu N	2002	Pattern Analysis and Machine Intelligence2002，24，：	1
13	Efficient algorithms for robust feature matching 显示文摘	MOUNT D M NETANYAHU N S LE-MOIGNE J	1999	Pattern recognition1999，32，1：	1
14	An optimal algorithm for approximate nearest neighbor searching in fixed dimensions显示文摘	Arya S Mount D M Netanyahu N S et aL	1998	JACM1998，45，6：	1
15	The draft genome of the transgenic tropical fruit tree papaya ( Carica pap aya Linnaeus ) 显示文摘	MING R HOU S B FENG Y YU Q DIONNE-LAPORTE A SAW J H SENIN P WANG W LY B V LEWIS K L T SALZBERG S L FENG L GONES M R SKELTON R L MURRAYJ E CHEN C QIAN W SHEN J DU P EUSTICE M TONG E TANG H LYONS E PAULL R E MICHAEL T P WALL K RICE D W ALBERT H WANG M L ZHU Y J SCHATZ M NAGARAJAN N ACOB R A GUAN P BLAS A WAI C M ACKERMAN C M REN Y LIU C WANG J M WANG J P NA J SHAKIROV E V HAAS B THIMMAPURAM J NELSON D WANG X BOWERS J E GSCHWEND A R DELCHER A L SINGH R SUZUKI J Y TRIPATHI S NEUPANE K WEI H IRIKURA B PAIDI M JIANG N ZHANG W PRESTING G WINDSOR A NAVAJAS-PEREZ R TORRES M J FELTUS A PORTER B LI Y BURROUGHS A M LUO M C LIU L CHRISTOPHER D A MOUNT S M MOORE P H SUGIMURA T JIANG J SCHULER M A FRIEDMAN V MITCHELL-OLDS T SHIPPEN D E PAMPHILIS C W PALMER J D FREELING M PATERSON A H GONSALVES D WANG L ALAM M	2008	Nature2008，452，：	1
16	The discrete geodeic problem 显示文摘	Mitchell J S B Mount D M Papadimitriou C H	1987	SIAM Journal on Computing1987，16，4：	1
17	A local search approximation algorithm for k-means clustering显示文摘	KANUNG0 T MOUNT D M	2004	Computational Geometry2004，28，：	1
18	An optimal algo?rithm for approximate nearest neighbor searching fixed dimen?sions显示文摘	Arya S Mount D M Netanyahu N S	1998	Journal of the ACM1998，45，6：	1
19	An efficient K-means clustering algorithm: analysis and implementation显示文摘	Kanungo T Mount D M Netanyahu N S	2002	IEEE Transactions on Pattern Analysis and Machine Intelligence2002，24，7：	1
20	Ultrasonic measurement of the inter-electrode gap in electrochemical machining显示文摘	Clifton D Mount A R Alder G M	2002	International Journal of Machine Tools and Manufacture2002，42，11：	1

返回顶部每页显示：

共10页首页上一页第1页下一页末页 /10 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示