Chinese translation for "kleinberg"

克莱因贝格
克莱因贝里
克莱因伯格

Related Translations:

jon kleinberg:  克莱伯格乔恩克莱因伯格

Example Sentences:

	1.	19 kleinberg j m . authoritative sources in a hyperlinked environment . journal of the acm , 1999 , 46 : 604 - 632 为解决这些问题，本文提出一种新的符号网络共体挖掘算mcs算法。
	2.	Kleinberg shows that , by using only local information , the greedy routing algorithm performs in o lg 2 n expected number of hops 为了弥补这方面的不足， kleinberg提出了一种基于d维toroidal lattice的理论模型。
	3.	Nature , 1999 , 401 : 130 - 131 . 3 watts d , strogatz s . collective dynamics of small - world networks . nature , 1998 , 393 : 440 - 442 本文拓展了kleinberg的理论模型，每个节点除了保持原有的local和long - range的连接边外，还增加了两条连接边。
	4.	We extend kleinberg s small - world model by allowing each node x to have two more random links to nodes chosen uniformly and randomly within manhattan distance from x 在此模型中，每个节点除了跟网格的local节点相连外，还跟long - range节点以d - harmonic随机分布方式相连。
	5.	8 newman m e j . models of the small world . journal of statistical physics , 2000 , 101 : 819 - 841 . 9 newman m e j , watts d j . scaling and percolation in the small - world network model 由于martel和nguyen已经证明了kleinberg的small world理论模型的直径为o lg n ，本文的路由时间已经达到了最优复杂度。
	6.	Parallel and distributed processing and applications , nanjing , china , 2005 , pp . 503 - 513 . 17 kemper d , kleinberg j , demers a . spatial gossip and resource location protocols . in proc 类似于symphony模型的设计原理，本文的理论成果可应用于大规模分布式网络的结构设计，比如peer - to - peer网络逻辑层的结构设计。
	7.	Those information can be used to enhance the search engine technology . in this context , jon m . kleinberg ( in his paper authoritative sources in a hyperlinked environment ) introduced the following notions : 1 在这种情况下， jonkleinberg (在他的论文authoritativesourcesinahyperlinkedenvironment )介绍了下面的概念： 1
	8.	To our knowledge , our result is the first to achieve the optimal routing complexity while still keeping a poly - logarithmic number of bits of information stored on each node in the small - world networks 日前基于kleinberg理论模型的改进路由算法一般依靠增加local的awareness来提高路由效率。但此方案只能有限度改进路由时间复杂度。
	9.	Based on this extended model , we then propose an oblivious algorithm that can route messages between any two nodes in o expected number of hops . our routing algorithm keeps only o beta 1 bits of information on each node , where 1 Kleinberg证明了如果每个节点只用local的路由信息，简单的贪婪算法可以在o lg n 2的期望时间内完成任何两点间的路由过程。

Similar Words：

"klein-wardenberg syndrome" Chinese translation, "klein-wardenburg syndrome" Chinese translation, "kleinard" Chinese translation, "kleinbauer" Chinese translation, "kleinbegin" Chinese translation, "kleinberger" Chinese translation, "kleinbergova" Chinese translation, "kleinblittersdorf" Chinese translation, "kleinbord" Chinese translation, "kleinbort" Chinese translation