Find Academic Supervisors

James McCannView profile

Associate Professor

• Textiles Manufacturing
• Computer-Aided Fabrication
• Real-time Systems
• +5 more

James McCann is an Associate Professor at the Carnegie Mellon Robotics Institute, where he leads the Carnegie Mellon Textiles Lab. He has been a faculty member since May 2017 after working at Disney Research Pittsburgh. McCann's academic journey includes a PhD from Carnegie Mellon advised by Nancy Pollard, followed by a postdoc at Adobe Research and a period developing video games. McCann's research focuses on building creative tools that operate in real-time and build user intuition, with particular emphasis on textiles fabrication and machine knitting. His work spans computer-aided fabrication, simulation, graphics, and creative tools development. He has pioneered systems for machine knitting design, including compilers for knitting instructions and tools for automatic conversion of 3D meshes to knitting patterns. His recent publications demonstrate a strong trend toward computational textiles, with significant contributions to knitting semantics, deployable textile structures, and applications of machine knitting in healthcare and robotics. McCann's work bridges computer science, robotics, and textile arts, creating practical systems for once-off manufacturing with industrial knitting machines. McCann actively mentors students, with current PhD candidates working on solid knitting machines, knit calibration, and assistive devices. His teaching portfolio includes courses on Real-Time Graphics, Algorithmic Textiles Design, and Game Programming. He has taught at CMU since 2017, developing innovative courses that blend computer science with physical fabrication. As director of the Textiles Lab, McCann oversees research projects spanning machine knitting, robotic painting, and real-time graphics systems. His lab develops practical tools for creators, emphasizing intuitive interfaces and real-time feedback that lower barriers to advanced fabrication techniques.

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Arno SolinView profile

Associate Professor

• Machine Learning
• Signal Processing
• Sensor Fusion
• +8 more

Dr. Arno Solin is a tenured Associate Professor in Machine Learning at Aalto University's Department of Computer Science and an Academy of Finland Research Fellow . He leads the Aalto machine learning research group and serves as Director of the Finnish Doctoral Program Network in AI (AI-DOC) . His work bridges probabilistic modeling with practical applications in sensor fusion and real-time inference. ELLIS Scholar (European Laboratory for Learning and Intelligent Systems) Adjunct Professor at Tampere University Member of Young Academy Finland (2021–2025) Research Interests focus on data-efficient machine learning with probabilistic methods for real-time inference and sensor fusion. Key areas include Gaussian processes, diffusion models, stochastic differential equations, and uncertainty quantification in deep learning. His group develops methods that combine structural constraints with adaptive learning for deployment on resource-limited hardware. Publication Trends show consistent output in top venues (NeurIPS, ICML, ICLR, AISTATS) with emphasis on diffusion models , 3D scene reconstruction , and real-time probabilistic modeling . Recent works explore physics-informed learning, heterophily-aware graph models, and compressed representations for world models in reinforcement learning. Scientific Recognition : Awarded AI Researcher of the Year 2024 by AI Finland Teacher of the Year 2023 at Aalto CS ISIF Jean-Pierre Le Cadre Best Paper Award (2018) MLSP Schizophrenia Classification Challenge Winner (2014) NeurIPS/ICML Reviewer Awards Research Leadership includes coordinating Finland's AI Center of Excellence program and directing the Finnish Doctoral Program Network in AI (AI-DOC). He supervises 15+ doctoral/postdoctoral researchers and has spun off Spectacular AI , a company commercializing sensor fusion technology.

Erik B. SudderthView profile

Professor

• Machine Learning
• Computer Vision
• Statistical Inference
• +3 more

Erik B. Sudderth is a Professor of Computer Science and Statistics and Chancellor's Fellow at the University of California, Irvine (UCI). He leads the Learning, Inference, & Vision Group and directs multiple research centers, including the UCI Center for Machine Learning and Intelligent Systems and the HPI Research Center in Machine Learning and Data Science. He previously served as an Associate Professor at Brown University. Education: B.S. (summa cum laude) in Electrical Engineering from UC San Diego (1999), M.S. and Ph.D. in EECS from MIT (2002, 2006). His research focuses on statistical methods for scalable machine learning, Bayesian nonparametrics, probabilistic graphical models, and applications in computer vision, AI, and environmental science. Key areas include nonparametric clustering, deep generative models, and particle-based inference algorithms. Research interests span diverse topics: advancing Bayesian nonparametric models for medical time series, scalable variational inference, and AI ethics. Notable contributions include the NET-VISA seismic monitoring system (ISBA Mitchell Prize, 2014), the BNPy toolbox (NSF CAREER Award), and work on diverse particle max-product algorithms for continuous inference. Scientific awards include the NSF CAREER Award, ISBA Mitchell Prize, and recognition as one of "AI's 10 to Watch" (IEEE). He has served as editor for top journals (JMLR, IEEE PAMI) and conference chairs (NeurIPS, CVPR). His work bridges theory and practice, with applications in robotics, climate science, and healthcare. Labs/Teams: UCI Learning, Inference, & Vision Group; UCI Center for Machine Learning; CREATE Technology Center. Grants include NSF funding for visually impaired collaboration tools and soil biogeochemical modeling.

• Combinatorics
• Operator Theory
• Graph Theory
• +2 more

Sergio Bermudo Navarrete is a Professor at the Department of Economics, Quantitative Methods and Economic History, Universidad Pablo de Olavide. His research spans combinatorics, graph theory, and operator theory. Education: PhD in Mathematics (2003, University of Seville) with thesis on functional models of operators in Hilbert spaces. Research Interests: Focus on graph theory, domination problems, topological indices, and operator theory. Publication Trends: Recent work includes vertex-degree-based indices for oriented graphs, domination parameters in product graphs, and differential analysis of line graphs. Keywords span Computer Science , Mathematical Chemistry , and Operations Research . Collaborations: Frequent co-authors: José María Sigarreta Almira, José Manuel Rodríguez García, Juan Alberto Rodríguez-Velazquez. Contact: Email sbernav@upo.es .

Siva BalakrishnanView profile

Associate Professor

• Statistical Machine Learning
• Causal Inference
• Public Policy & Social Sciences
• +5 more

Siva Balakrishnan is an Associate Professor at Carnegie Mellon University with a joint appointment in the Department of Statistics and Data Science and the Machine Learning Department . He holds an affiliation with the Dietrich College of Humanities and Social Sciences. Previously, he was a postdoctoral researcher at UC Berkeley's Department of Statistics, advised by Martin Wainwright and Bin Yu, and earned his Ph.D. in Computer Science from CMU's Language Technologies Institute under Jaime Carbonell. His research focuses on statistical machine learning, causal inference, and high-dimensional statistics, with notable contributions to domain adaptation, optimal transport, and robust statistics. Education: Ph.D. in Computer Science, Carnegie Mellon University (Language Technologies Institute) Postdoctoral Researcher, University of California, Berkeley (Department of Statistics) Research Interests: His work bridges theoretical foundations and algorithmic development, emphasizing robust statistical methods and their applications in causal inference, public policy, and machine learning. Key areas include nonparametric methods, optimization, and high-dimensional data analysis. He has pioneered techniques in domain adaptation, such as the RLSbench framework for relaxed label shift scenarios. Awards & Grants: Amazon Research Award (2021) Google Research Scholar Award (2021) NVIDIA Pioneer Award (2018) IMS Lawrence D. Brown Student Award (2020, 2022) National Science Foundation Grants (CCF-1763734, DMS-1713003, etc.) Professional Activities: He serves as an Associate Editor for JASA and on the editorial boards of Foundations and Trends in Statistics . His work has been featured in top venues like NeurIPS, ICML, and the Annals of Statistics. He currently holds a sabbatical at UC Berkeley's Department of Statistics (Spring 2025). Labs & Collaborations: He actively participates in the Statistics and Machine Learning Reading Group and the Causal Inference Working Group , fostering interdisciplinary research in CMU's vibrant academic community.

Kimon FountoulakisView profile

Associate Professor

• Machine Learning on Graphs
• Numerical Optimization
• Graph Algorithms
• +2 more

Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.

• Databases
• Data Mining
• Machine Learning
• +3 more

Ming-Syan Chen is a distinguished academic holding dual roles as a Distinguished Research Fellow and Director of the Research Center for Information Technology Innovation (CITI) at Academia Sinica, Taiwan, and a Distinguished Professor jointly appointed across multiple departments at National Taiwan University (NTU), including Electrical Engineering (EE), Computer Science and Information Engineering (CSIE), and the Graduate Institute of Communication Engineering (GICE). His career spans academia and industry, with prior roles as a research staff member at IBM Watson Research Center and leadership positions in Taiwan's technology sector. Education: He earned a B.S. in Electrical Engineering from National Taiwan University, followed by M.S. and Ph.D. degrees in Computer, Information, and Control Engineering from the University of Michigan, Ann Arbor. Research Interests: Chen's work focuses on databases, data mining, machine learning, multimedia networking, and cloud computing. He has authored over 350 papers and holds numerous patents, contributing to foundational advancements in query processing, data management, and networked systems. Award Highlights: Recipient of ACM and IEEE Fellowships, National Chair Professorship (lifetime honor), Teco Award, Pan Wen Yuan Distinguished Research Award, and IBM's Outstanding Innovation Award. His contributions span research, teaching, and technology commercialization. Leadership & Service: Former Dean of NTU's College of Electrical Engineering and Computer Science, CEO of Taiwan's Networked Communication Program, and Editor-in-Chief of the International Journal of Electrical Engineering. He has chaired international conferences and served on editorial boards of journals like IEEE TKDE and VLDB. Labs & Teams: Leads the Network Database Laboratory and collaborates on national initiatives in information and communication technologies. His research groups focus on data science, distributed systems, and social network analysis.

Anna GottardView profile

Associate Professor

• Multivariate Statistical Models
• Graphical Models
• Statistical Machine Learning
• +5 more

Anna Gottard is an Associate Professor of Statistics at the University of Florence, where she leads the Department of Statistics, Computer Science, and Applications. She directs the Florence Center for Data Science (FDS) and participates in the Technical Scientific Committee of the Tuscan Center for Big Data, Data Science, and AI (CBDAI). Her research focuses on multivariate statistical models, particularly graphical models, and extends to statistical machine learning, fair models, and directional data analysis. She is an Associate Editor for the Journal of the Royal Statistical Society Series A (JRSSA) and Statistical Methods & Applications (SMA). Her recent work includes Bayesian approaches for mixed graphical models, uncertainty-aware classification trees, and methodological advancements in latent uncertainty models. Her contributions span theoretical developments and applied research in interdisciplinary areas like biostatistics and sustainability. Her research interests emphasize bridging statistical theory with practical applications, including fairness in machine learning, interpretable models, and tree-based methodologies. She has actively contributed to open-source software, notably the Mix3Trees R package for mixed-effect tree models. Her work addresses challenges in variable selection, graphical model inference, and ethical AI practices. Current projects explore Bayesian frameworks for complex data structures and methodological improvements in graphical model interpretability. Anna has advised on interdisciplinary collaborations, such as studies on GDPR compliance in biobanking and epidemiological modeling of the SARS-CoV-2 pandemic in Tuscany. She collaborates with institutions like the CBDAI to advance data science applications in regional policy and healthcare. Her research trajectory reflects a commitment to both foundational statistical theory and real-world problem-solving across diverse domains.

• Computational Physics
• Machine Learning
• Applied Mathematics
• +7 more

Andrew M. Stuart is a Professor at the California Institute of Technology's Division of Engineering and Applied Science. His research bridges computational mathematics, machine learning, and physical modeling, focusing on inverse problems, partial differential equations, and multiscale systems. He has pioneered methodologies integrating Gaussian processes, Kalman inversion, and neural operators for scientific computing. His recent publications highlight innovations in competitive protein dimerization networks, nonlinear Bayesian inference, and operator learning. Articles span applications in materials science, geophysics, and biochemical signal processing, emphasizing data-driven discovery of differential equations and scalable algorithms for high-dimensional problems. Stuart's work addresses challenges in structural error modeling, uncertainty quantification, and graph-based learning, with implications for climate modeling and dynamical systems. Despite extensive contributions, the scraped data does not specify students, awards, or contact details.

Ruihong HuangView profile

Associate Professor

• Natural Language Processing (NLP)
• Information Extraction
• Machine Learning
• +6 more

Ruihong Huang is an Associate Professor in the Department of Computer Science and Engineering at Texas A&M University, part of the College of Engineering. She holds a Ph.D. from the University of Utah (2014) and completed a postdoctoral fellowship at Stanford University. Her research focuses on Natural Language Processing (NLP) with emphasis on information extraction, event recognition, media bias analysis, and ethical AI applications. She teaches courses like Information Storage and Retrieval (CSCE 470), Natural Language Processing (CSCE 638), and has advised numerous PhD, Master’s, and undergraduate students. Key research contributions include work on event coreference resolution, discourse analysis, and detecting media bias through event relation graphs. Huang has developed benchmark datasets like UAL-Bench and EMONA, and her work spans applications in disaster management, fake news detection, and moral reasoning in LLMs. She is a recipient of the NSF CAREER Award and serves on program committees for top conferences like ACL and EMNLP. Her academic service includes roles as Area Chair for ACL 2024 and Senior Area Chair for EMNLP 2024. She maintains an active lab group focusing on NLP fundamentals and real-world applications, with projects involving propaganda identification, polarity calibration for opinion summarization, and multimodal dialog act classification. Huang has published over 80 papers in top-tier venues such as NAACL, EMNLP, ACL, and NeurIPS.

• Optimization
• Complex Networks
• Statistical Inference
• +3 more

Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.

Florian KerschbaumView profile

Professor

• Data security and privacy
• Confidentiality and integrity in data science
• Applied cryptography
• +4 more

Florian Kerschbaum is a Professor and NSERC/RBC Industrial Research Chair in Data Security at the Cheriton School of Computer Science, University of Waterloo. His research focuses on data security and privacy, applied cryptography, and confidentiality in data science. Research interests span data collection/preparation management, secure multi-party computation, homomorphic encryption, differential privacy, and machine learning robustness/privacy. His work develops cryptographic solutions for practical data management challenges in distributed systems.

Amit KumarView profile

Professor

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +5 more

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Anush TserunyanView profile

Professor

• Mathematics
• Ergodic Theory
• Combinatorics
• +3 more

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.