Publications supported by the NSF Award IIS-0812309

Back

Order By Time / Order By Type

  1. George Kollios, Michalis Potamias, and Evimaria Terzi. Clustering Large Probabilistic Graphs. To Appear in IEEE TKDE. [PDF]
  2. Panagiotis Papapetrou, Gary Benson, and George Kollios. Mining Poly-regions in DNA. International Journal of Data Mining and Bioinformatics (IJDMB), August, 2012. [PDF]
  3. Haohan Zhu, George Kollios, and Vassilis Athitsos. A Generic Framework for Efficient and Effective Subsequence Retrieval. Proceedings of the 38th VLDB (PVLDB), Istanbul, Turkey, August, 2012. [PDF]
  4. Alexios Kotsifakos, Panagiotis Papapetrou, Jaakko Hollmén, Dimitrios Gunopulos, Vassilis Athitsos, and George Kollios. Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System. (Demo Paper) Proceedings of the 38th VLDB (PVLDB), Istanbul, Turkey, August, 2012. [PDF]
  5. Panagiotis Papapetrou, Vassilis Athitsos, Michalis Potamias, George Kollios, and Dimitris Gunopulos. Embedding-based Subsequence Matching in Time Series Databases. ACM TODS, Vol. 36, No 3, August 2011. [PDF]
  6. Michalis Potamias. Analyzing Probabilistic Graphs. PhD Thesis, Boston University, 2011. [PDF]
  7. Michalis Potamias, Francesco Bonchi, Aris Gionis, and George Kollios. k-Nearest Neighbors in Uncertain Graphs. Proc. of the 36th VLDB International Conference on Very Large Databases, Singapore, September 2010. [PDF]
  8. Panagiotis Papapetrou, Vassilis Athitsos, George Kollios, and Dimitrios Gunopulos. Reference-Based Alignment in Large Sequence Databases. Proc. of the 35th VLDB International Conference on Very Large Databases, Lyon, France, August 2009. [PDF]
  9. Panagiotis Papapetrou. Embedding-based Subsequence Matching in Large Sequence Databases. PhD Thesis, Boston University, 2009. [PDF]

Back