![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Yang Du Evangelos Kanoulas , Yang Du, Tian Xia , Donghui Zhang : Finding Fastest Paths on A Road Network with Speed Patterns. ICDE 2006 : 10 Yang Du, Donghui Zhang , Tian Xia : The Optimal-Location Query. SSTD 2005 : 163-180 Tian Xia , Donghui Zhang , Evangelos Kanoulas , Yang Du: On Computing Top-t Most Influential Spatial Sites. VLDB 2005 : 946-957 1 [ 1 ] [ 3 ] 2 [ 1 ] [ 2 ] [ 3 ] 3 [ 1 ] [ 2 ] [ 3 ] ![]() ©2006 Association for Computing Machinery |