جست‌وجوی استاد و پژوهشگر

David W. Jacobsمشاهده پروفایل

استاد

• Computer Vision
• Machine Learning
• Object Recognition
• +۱۱ مورد دیگر

David W. Jacobs is a Professor in the Department of Computer Science at the University of Maryland, with a joint appointment at the University of Maryland Institute for Advanced Computer Studies (UMIACS). He also served as the interim Director of the University of Maryland Center for Machine Learning starting in 2018. University: University of Maryland School: College of Computer, Mathematical, and Natural Sciences Department: Department of Computer Science Academic Rank: Professor Education: He received his B.A. from Yale University, and M.S. and Ph.D. in Computer Science from MIT. Research Interests: His research primarily focuses on computer vision and machine learning, particularly visual object recognition, lighting variation modeling, 3D reconstruction, perceptual organization, motion understanding, and the integration of vision with graphics and human-computer interaction. A major applied contribution is the development of Leafsnap , an electronic field guide app for plant identification, which has been downloaded over 1.5 million times and used in biodiversity and educational contexts. Publication Trends: His recent scholarly output centers on deep learning, convolutional networks, residual architectures, generative models (especially GANs), and interpretability. His work often bridges theoretical insights with practical applications in vision and AI. Scientific Awards: Honorable Mention, Best Paper Award, CVPR 2000 Best Student Paper Award, UIST 2003 Best Paper Award, Eurographics 2016 2011 Edward O. Wilson Biodiversity Technology Pioneer Award for Leafsnap Teaching and Advising: He has taught advanced courses such as CMSC 422 (Introduction to Machine Learning) and CMSC 828L (Deep Learning). He mentors students through course projects and research, though specific advisees are not listed. He has collaborated with institutions like Columbia University and the Smithsonian on impactful interdisciplinary projects. Labs and Teams: He is affiliated with UMIACS and leads research efforts in vision and learning, contributing to the University of Maryland Center for Machine Learning. His team has developed several mobile applications including Leafsnap, Birdsnap, and Dogsnap, demonstrating a strong focus on real-world deployment of vision technology.

Zhuoyue Zhaoمشاهده پروفایل

استادیار

• Database systems
• Security
• Query processing
• +۶ مورد دیگر

Zhuoyue Zhao is an Assistant Professor in the Department of Computer Science and Engineering at the University at Buffalo, School of Engineering and Applied Sciences. His office is located at 338I Davis Hall, Buffalo, NY 14260, and he can be reached at zzhao35@buffalo.edu or by phone at (716) 645-4735. Dr. Zhao received his PhD in Computer Science from the University of Utah in 2021, where he was advised by Prof. Feifei Li and Prof. Jeff Phillips. Prior to that, he earned his BS in Computer Science from Shanghai Jiao Tong University in 2016, where he was part of the prestigious ACM Class. During his undergraduate studies, he conducted research under Prof. Kenny Zhu and spent Fall 2015 as a research assistant at Hong Kong Polytechnic University supervised by Prof. Eric Lo. Dr. Zhao's research focuses on database management systems, with specific emphasis on traditional and approximate query processing, query optimization, database systems on modern hardware, transaction processing, indexing, and storage. His work bridges theoretical foundations with practical implementations, often resulting in systems that address real-world database challenges. He has made significant contributions to probabilistic query processing, transaction scheduling, and learned indexing techniques. His recent publications demonstrate a clear trajectory toward optimizing database performance in hybrid transactional/analytical processing environments. His research increasingly integrates systems techniques with machine learning approaches, particularly in the area of learned indexes. There's also a strong focus on making database operations more efficient through innovative scheduling mechanisms and query processing techniques that can handle concurrent updates. Google PhD Fellowship (2019-2021) Best Paper Award at SIGMOD 2016 for "Wander Join: Online Aggregation via Random Walks" Best Paper Award at SIGMOD 2025 for "Low-Latency Transaction Scheduling via Userspace Interrupts" Dr. Zhao currently advises several PhD students including Yunnan Yu, Congying Wang, Gaoxiang Liu (co-advised with Prof. Ziming Zhao), and Zhuoran Li. He has successfully guided MS student Nithin Sastry Tellapuri to graduation (Fall 2023), who is now employed at AirPay. His research is supported by significant funding including an NSF CAREER award (#2339596) totaling $599,977 for research on "Speedy and Reliable Approximate Queries in Hybrid Transactional/Analytical Systems" (2024-2029) and an unrestricted Google gift of $30,000 (2021). Dr. Zhao leads the ADBLab research group at UB, where students work on cutting-edge database systems research. His lab focuses on building practical database systems that address real-world challenges in query processing, transaction management, and indexing. The lab maintains strong connections with industry partners and regularly contributes to open-source database projects.

• Computational Physics
• Machine Learning
• Applied Mathematics
• +۷ مورد دیگر

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.

Zongyi Liمشاهده پروفایل

پژوهشگر ارشد

• Machine Learning
• Scientific Computing
• Partial Differential Equations
• +۵ مورد دیگر

Zongyi Li is a Research Fellow at Massachusetts Institute of Technology , hosted by Kaiming He. They are currently pursuing a Ph.D. in Computing and Mathematical Sciences at Caltech (2019-2025), mentored by Anima Anandkumar and Andrew Stuart. Ph.D. candidate: Computing and Mathematical Sciences, Caltech (2019-2025) B.Sc. in Computer Science and Mathematics with a Jazz minor from Washington University in St. Louis (2015-2019) They focus on Neural Operators for learning solution operators in Partial Differential Equations (PDEs) , particularly in fluid mechanics and earth science . Their work models physical simulations with chaotic behaviors and complex geometries, showing applications in weather forecasting , carbon storage , and aerodynamics simulation . Publications emphasize resolution-invariant models , chaotic systems , and zero-shot super-resolution capabilities. Their research combines Fourier analysis , graph networks , and physics-informed loss functions to achieve state-of-the-art performance in PDE solving with up to 1000x speedup over traditional solvers. Fellowships: Kortschak Scholarship PIMCO Fellowship Amazon AI4Science Fellowship Nvidia Fellowship MIT Novo Nordisk AI Fellowship Code & Open-Source: Co-developer of the NeuralOperator library Implementations for Fourier Neural Operators , Graph Neural Operators , and Tensorized Neural Operators Media Recognition: Quanta Magazine MIT Tech Review NVIDIA Features Towards Data Science

Alexander Gorodnikمشاهده پروفایل

استاد

• Dynamical Systems
• Analytic Number Theory
• Diophantine Approximation
• +۵ مورد دیگر

Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .

Amit Kumarمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +۵ مورد دیگر

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.

Theo Damoulasمشاهده پروفایل

استاد

• Probabilistic Machine Learning
• Bayesian Statistics
• Digital Twins
• +۵ مورد دیگر

Theo Damoulas is a Professor of Machine Learning at the University of Warwick with a joint appointment in the Department of Computer Science and Statistics. He is a Turing AI Fellow (2021-2026) through UK Research and Innovation, an ELLIS member, and a Visiting Professor at New York University's Center for Urban Science and Progress (CUSP). He founded and leads the Warwick Machine Learning Group and has directed major projects at The Alan Turing Institute including Project Odysseus and the London Air Quality project. Education includes: PhD in Probabilistic Multiple Kernel Learning (University of Glasgow, 2009) MSc in Informatics (Distinction, University of Edinburgh, 2004) MEng in Mechanical Engineering (1st Class, University of Manchester, 2003) His research focuses on probabilistic machine learning and Bayesian statistics, emphasizing the integration of structural priors, spatiotemporal dependencies, physical laws, and causal relationships. Key applications include Digital Twins, urban science, and computational sustainability. His work advances robust and scalable inference methodologies for complex real-world systems. Publications demonstrate strong emphasis on Bayesian methods, spatiotemporal modeling, and uncertainty quantification, with applications spanning battery modeling, urban mobility, federated learning, and causal inference. Recent work shows increased focus on physics-informed models, federated learning frameworks, and causal abstraction techniques. Major scientific awards: Turing AI Acceleration Fellowship (2021-2026) Best Paper Awards (Wilkes 2024, AISTATS 2022, IEEE ICMLA 2010) ACM SIGMOD Most Reproducible Paper (2017) Dissertation Award (Classification Society 2012) Teaching Excellence nominations (Warwick 2015-2017) He actively advises PhD students and secured significant grants including the £multi-million Turing AI Fellowship. Current doctoral researchers investigate federated learning, causal inference, and spatiotemporal modeling. He leads the Warwick Machine Learning Group, a cross-departmental team developing foundational ML methods for scientific and societal challenges.

John Paisleyمشاهده پروفایل

دانشیار

• Machine Learning
• Bayesian Statistics
• Data Science
• +۳ مورد دیگر

John Paisley is an Associate Professor of Electrical Engineering at Columbia University's Fu Foundation School of Engineering and Applied Science, and a member of Columbia's Data Science Institute (DSI). He holds a B.S., M.S., and Ph.D. in Electrical and Computer Engineering from Duke University (2004-2010), followed by postdoctoral research in Computer Science at Princeton University and UC Berkeley. His research focuses on Bayesian models, posterior inference techniques for Big Data, and applications in data analysis, recommendation systems, information retrieval, and compressed sensing. He has pioneered methods like Bayesian Gaussian Process ODEs and Double Normalizing Flows, with recent work emphasizing uncertainty quantification in environmental modeling and neuroimaging analysis. His collaborative workflows (e.g., bneR ) address air pollution exposure and PM2.5 concentration uncertainties, combining Bayesian nonparametric ensembles with geospatial data. He has also developed frameworks for neural network interpretability, image denoising, and compressed sensing MRI. Paisley's work bridges statistical theory and applied machine learning, with applications in healthcare, environmental science, and geophysics. His academic contributions include over 50 publications since 2016, spanning topics like deep metric learning, adversarial learning, and variational inference optimization. He maintains an active research group and serves on editorial boards for machine learning and signal processing journals.

David Bindelمشاهده پروفایل

دانشیار

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +۵ مورد دیگر

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

Sainyam Galhotraمشاهده پروفایل

استادیار

• Artificial Intelligence
• Causal Inference
• Database Systems
• +۴ مورد دیگر

Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .

Amir Ali Ahmadiمشاهده پروفایل

استاد

• Optimization Theory
• Control Theory
• Dynamical Systems
• +۷ مورد دیگر

Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.

Yimin D. Zhangمشاهده پروفایل

دانشیار

• Statistical Signal Processing
• Array Processing
• Radar Signal Processing
• +۱۰ مورد دیگر

Yimin D. Zhang is an Associate Professor in the Department of Electrical and Computer Engineering at Temple University's College of Engineering, where he leads the Advanced Signal Processing (ASP) Lab. His research spans statistical signal processing, array processing, radar, wireless communications, and convex optimization. Research Interests: Dr. Zhang's work focuses on cutting-edge signal processing techniques including compressive sensing, sparse arrays, time-frequency analysis, and robust beamforming. These are applied to radar systems, satellite navigation, assisted living, and wireless networks. His research addresses core challenges in target localization, direction-of-arrival estimation, and spectrum-efficient joint radar-communication systems. The recent publications highlight a strong trend in exploiting sparsity, virtual arrays, and deep learning to enhance resolution and robustness in radar and communication systems. Themes include multi-frequency processing, low-rank matrix recovery, and optimized OFDM waveforms for dual-function systems. Scientific Awards: 2016 IET Radar, Sonar and Navigation Premium Award 2017 IEEE Aerospace and Electronic Systems Society Harry Rowe Mimno Award 2018 IEEE Signal Processing Society Young Author Best Paper Award (coauthor) Advising and Grants: Dr. Zhang has served as Principal or Co-Principal Investigator on over $6 million in research funding from the NSF, AFRL, ONR, and DARPA. While student advisees are not listed, his leadership of the ASP Lab suggests active mentorship of graduate researchers. He contributes extensively to the academic community as an associate editor for IEEE Transactions on Signal Processing and editor for Signal Processing journal, and serves on key IEEE technical committees. Labs and Teams: He directs the Advanced Signal Processing (ASP) Lab at Temple University, which focuses on developing novel algorithms for real-world applications in radar, communications, and navigation. Previously, he led the Wireless Communications and Positioning Lab and the RFID Lab at Villanova University.

Wojciech Rytterمشاهده پروفایل

استاد

• Design and analysis of computer algorithms
• Automata and formal languages
• Parallel algorithms
• +۵ مورد دیگر

Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.

Daniel M. Kaneمشاهده پروفایل

استاد

• Number Theory
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

• Theoretical Computer Science
• Algorithm Design and Analysis
• Graph Algorithms
• +۵ مورد دیگر

Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).