George Kollios is an Professor in the Computer Science Department at Boston University in Boston, Massachusetts. He received his Diploma in Electrical and Computer Engineering in 1995 from the National Technical University of Athens, Greece; and the M.Sc. and Ph.D. degree in Computer Science from Polytechnic University (NYU-Poly), New York in 1998 and 2000 respectively. His research interests include spatio-temporal indexing and data mining, database security, multimedia indexing, and approximation algorithms for large scale data management problems. He has been and Associate Editor for ACM Transactions of Database Systems and IEEE TKDE and served in a number of program committees for database and data mining conferences. His research has been supported by NSF, including an NSF CAREER Award, and IARPA. He is a member of ACM and IEEE Computer Society.
G. Kollios, M. Potamias, and E. Terzi. Clustering Large Probabilistic Graphs. IEEE TKDE, Vol. 25, No. 2, February 2013.
H. Zhu, G. Kollios, and V. Athitsos. A Generic Framework for Efficient and Effective Subsequence Retrieval. 38thVLDB (PVLDB), Istanbul, Turkey, August 2012.
P. Papapetrou, V. Athitsos, M. Potamias, G. Kollios, and D.Gunopulos. Embedding-based Subsequence Matching in Time Series Databases. ACM TODS, Vol. 36, No 3, August 2011.