Aida Sheshbolouki, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor M. Tamer Özsu
Edward Eaton, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Douglas Stebila
Broňa Brejová, Department of Computer Science
Comenius University in Bratislava, Slovakia
Many successful tools in bioinformatics are based on working with k-mers, substrings of length k of the input sequences. In this talk, we will discuss two less-known areas where k-mers can be used.
Pamela Wisniewski, Associate Professor
Department of Computer Science, University of Central Florida
Tomáš Vinař, Department of Applied Informatics
Comenius University in Bratislava, Slovakia
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Brad Glasbergen, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Khuzaima Daudjee
Data systems are known for their complexity; they contain a vast number of features and configuration parameters to support different use cases. As no single data system can efficiently process all workload types, administrators face a daunting task:
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
Kaladhar Voruganti, Senior Fellow
Technology and Architecture, Office of the CTO, Equinix
Abhinav Bommireddi, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Eric Blais
A body K ⊂ Rn is convex if and only if the line segment between any two points in K is completely contained within K or, equivalently, if and only if the convex hull of a set of points in K is contained within K.