>> Information For:   |   Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?
 Research Detail:


  Database, Data mining and Information Systems >Spatial Data Management:
  Recent Publications:

15. C. M. R. Haider, Arif Arman, Mohammed Eunus Ali, and Farhana Farhana Murtaza Choudhury, Continuous Maximum Visibility Query for a Moving Target. In Proceedings of Australasian Database Conference (ADC), Springer, Sydney, Australia, pages 82--94, 2016
14. Mohammed Eunus Ali, Egemen Tanin, Peter Scheuermann, Sarana Nutanong, and Lars Kulik, Spatial Consensus Queries in a Collaborative Environment. ACM Trans. Spatial Algorithms and Systems, ACM, 2(1), :3, 2016
13. A. K. M. Mustafizur Rahman Khan, Tanzima Hashem, Egemen Tanin, and Lars Kulik, Location Oblivious Privacy Protection for Group Nearest Neighbor Queries. In Proceedings of 18th International Conference on Geographic Information Science (GIScience), Springer, Vienna, Austria, pages 301-317, 2014
12. S. Masud, F. M. Choudhury, Mohammed Eunus Ali, and S. Nutanong, Maximum Visibility Queries in Spatial Databases. In Proceedings of ICDE, 2013
11. Hossain Mahmud, Ashfaq Mahmood Amin, Mohammed Eunus Ali, Tanzima Hashem, and Sarana Nutanong, A Group Based Approach for Path Queries in Road Networks. In Proceedings of 13th international symposium on spatial and temporal databases (SSTD 2013), LNCS, Munich, Germany, 2013
10. Tanzima Hashem, Mohammed Eunus Ali, Lars Kulik, Egemen Tanin, and Anthony Quattrone, Protecting Privacy for Group Nearest Neighbor Queries with Crowdsourced Data and Computing. In Proceedings of the 2013 ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp), ACM, Zurich, Switzerland, 2013
9. Mohammed Eunus Ali, E. Tanin, R. Zhang, and R. Kotagiri, Probabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor Queries. the DKE Journal (Impact Factor: 1.852)., 75:1-33, 2012
8. Tanzima Hashem, Lars Kulik, and Rui Zhang, Countering Overlapping Rectangle Privacy Attack for Moving kNN Queries. Information Systems, 2012
7. Tanzima Hashem, and Lars Kulik, "Don't Trust Anyone": Privacy Protection for Location-Based Services. Pervasive and Mobile Computing (PMC), 7(1), :44-59, 2011
6. Mohammed Eunus Ali, R. Zhang, E. Tanin, and L. Kulik, A Motion-Aware Approach for Efficient Evaluation of Continuous Queries on 3D Object Databases. VLDB Journal. (Impact Factor: 6.8)., 19(5), :603-632, 2010
5. S. Nutanong, E. Tanin, Mohammed Eunus Ali, and L. Kulik, Local Network Voronoi Diagram. In Proceedings of ACM SIGSPATIAL GIS 2010,(Acceptance rate 20%)., San Jose, California, 2010
4. Tanzima Hashem, Lars Kulik, and Rui Zhang, Privacy preserving group nearest neighbor queries. In Proceedings of 3rd International Conference on Extending Database Technology (EDBT), Lausanne, Switzerland, pages 489-500, 2010
3. Mohammed Eunus Ali, R. Zhang, E. Tanin, and L. Kulik, A Motion-Aware Approach to Continuous Retrieval of 3D Objects. In Proceedings of International Conference of Data Engineering. ICDE 2008, (Acceptance rate 12.1%)., Cancun, Mexico, pages 843-852, 2008
2. Mohammed Eunus Ali, E. Tanin, R. Zhang, and L. Kulik, Load Balancing for Moving Object Management in a P2P Network. In Proceedings of Lecture Notes in Computer Science (LNCS), Database Systems for Advanced Applications, DASFAA 2008, (Acceptance rate 16.6%)., New Delhi, India, pages 251-266, 2008
1. Tanzima Hashem, and Lars Kulik, Safeguarding Location Privacy in Wireless Ad-Hoc Networks. In Proceedings of 9th International Conference on Ubiquitous Computing (UbiComp), Innsbruck, Austria, pages 372-390, 2007

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact info@cse.buet.ac.bd with questions or comments on this page.  [Development Credits]