Computer Science
Showing 1-50 of 140 Results
-
Kovid Capildeo
Undergraduate, Computer Science
BioI'm an undergrad from Trinidad exploring mathematics and computer science, and I enjoy robotics, contest math and calypso on the side.
-
Edward Y. Chang
Affiliate, Computer Science
BioEdward Y. Chang has been an adjunct professor in Stanford’s Computer Science Department since 2019. Previously, he was a tenured professor at UC Santa Barbara. From 2006 to 2012, he served as a director at Google Research, where he pioneered data-centric and parallel machine learning and contributed to the ImageNet project. Chang later became president of HTC Healthcare, where he developed AI-powered diagnostics and won the Tricorder XPRIZE. He has also held positions at HKUST and UC Berkeley. Chang earned an MS in Computer Science and a PhD in Electrical Engineering from Stanford. He is a Fellow of ACM and IEEE for his contributions to scalable machine learning and healthcare AI.
Since 2019, Chang’s research has focused on virtual assistance, collaborating with Monica Lam, and more recently on large language models (LLMs). He hypothesizes that LLM Collaborative Intelligence (LCI) could pave the way toward artificial general intelligence (AGI).
Chang has authored seven books, including:
Unlocking the Wisdom of Large Language Models (2024)
LLM Collaborative Intelligence: The Path to Artificial General Intelligence (2024)
Journey of the Mind (Poetry, 2023)
Mandarin translation of Erwin Schrödinger’s What is Life? Mind and Matter (2021)
Big Data Analytics for Large-Scale Multimedia Search (2019)
Nomadic Eternity (Poetry, 2012)
Foundations of Large-Scale Multimedia Information Management and Retrieval (2011) -
Moses Charikar
Donald E. Knuth Professor
Current Research and Scholarly InterestsEfficient algorithmic techniques for processing, searching and indexing massive high-dimensional data sets; efficient algorithms for computational problems in high-dimensional statistics and optimization problems in machine learning; approximation algorithms for discrete optimization problems with provable guarantees; convex optimization approaches for non-convex combinatorial optimization problems; low-distortion embeddings of finite metric spaces.
