![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Egemen Tanin Egemen Tanin, Aaron Harwood , Hanan Samet : A Distributed Quadtree Index for Peer-to-Peer Settings. ICDE 2005 : 254-255 Egemen Tanin, Aaron Harwood , Hanan Samet : Indexing Distributed Complex Data for Complex Queries. DG.O 2004 Hanan Samet , Egemen Tanin, Leana Golubchik : Scalable Data Collection Infrastructure for Digital Government Applications. DG.O 2004 Egemen Tanin, Aaron Harwood , Hanan Samet , Sarana Nutanong , Minh Tri Truong : A serverless 3D world. GIS 2004 : 157-165 Hanan Samet , Houman Alborzi , Frantisek Brabec , Claudio Esperança , Gísli R. Hjaltason , Frank Morgan , Egemen Tanin: Use of the SAND spatial browser for digital government applications. Commun. ACM 46 (1): 61-64 (2003) Egemen Tanin, Frantisek Brabec , Hanan Samet : Remote access to large spatial databases. ACM-GIS 2002 : 5-10 Stephan Greene , Egemen Tanin, Catherine Plaisant , Ben Shneiderman , Lola Olsen , Gene Major , Steve Johns : The End of Zero-hit Queries: Query Previews for NASA's Global Change Master Directory. Int. J. on Digital Libraries 2 (2-3): 79-90 (1999) Richard Beigel , Egemen Tanin: The Geometry of Browsing. LATIN 1998 : 331-340 Egemen Tanin, Richard Beigel , Ben Shneiderman : Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces. INFOVIS 1997 : 81-86 Egemen Tanin, Richard Beigel , Ben Shneiderman : Incremental data Structures and Algorithms for Dynamic Query Interfaces. SIGMOD Record 25 (4): 21-24 (1996) Egemen Tanin, Tahsin M. Kurç , Cevdet Aykanat , Bülent Özgüç : Comparison of Two Image-Space Subdivision Algorithms for Direct Volume Rendering on Distributed-Memory Multicomputers. PARA 1995 : 503-512 1 [ 7 ] 2 [ 1 ] 3 [ 2 ] [ 3 ] [ 4 ] 4 [ 6 ] [ 7 ] 5 [ 7 ] 6 [ 9 ] 7 [ 5 ] 8 [ 8 ] [ 10 ] [ 11 ] 9 [ 7 ] 10 [ 5 ] 11 [ 1 ] 12 [ 5 ] 13 [ 7 ] 14 [ 8 ] 15 [ 5 ] 16 [ 1 ] 17 [ 5 ] 18 [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] 19 [ 2 ] [ 3 ] [ 5 ] 20 [ 8 ] ![]() ©2005 Association for Computing Machinery |