Jayant Krishnamurthy
Computer Science Department
School of Computer Science
Carnegie Mellon University
Email: <my first name>k at cs dot cmu dot edu
Office: GHC 7701
Computer Science Department
School of Computer Science
Carnegie Mellon University
Email: <my first name>k at cs dot cmu dot edu
Office: GHC 7701
Ph.D. candidate in Computer Science, CMU.
Tom Mitchell is my
advisor.
M.Eng. in Computer Science, MIT (2009).
Henry Lieberman was my
thesis advisor and Saman
Amarasinghe was my academic advisor.
S.B. in Computer Science, MIT (2008)
I've been a teaching assistant for:
6.857 - Computer
and Network Security (MIT, Spring 2009)
6.006 -
Introduction to Algorithms (MIT, Fall 2008)
Finding Analogies in Semantic Networks using the Singular Value Decomposition. by Jayant Krishnamurthy. Master's thesis, Massachusetts Institute of Technology. PDF CrossBridge, the analogy algorithm from the paper, is now included in Divisi.
An Interface for Targeted Collection of Common Sense Knowledge using a Mixture Model. by Robert Speer, Jayant Krishnamurthy, Catherine Havasi, Dustin Smith, Kenneth Arnold, Henry Lieberman. Proceedings of Intelligent User Interfaces, 2009. PDF
The MD6 Hash Function -- A Proposal to NIST for SHA-3 by Ronald L. Rivest, with Benjamin Agre, Daniel V. Bailey, Christopher Crutchfield, Yevgeniy Dodis, Kermin Elliott Fleming, Asif Khan, Jayant Krishnamurthy, Yuncheng Lin, Leo Reyzin, Emily Shen, Jim Sukha, Drew Sutherland, Eran Tromer, and Yiqun Lisa Yin. Submitted to NIST on October 27, 2008. PDF The latest version of the MD6 report, along with other related material and code is available from the MD6 website.
Binary Search Tees is a t-shirt website dedicated to computer science humor.
Millihelens is a website where people upload their pictures and vote for the hottest person. Scores are assigned in millihelens, a unit of beauty equal to the 1/1000th the beauty of Helen of Troy.
Insight Required is a blog devoted to MIT-Mystery-Hunt-style puzzles. I occasionally contribute new puzzles. This puzzle is my personal favorite.
Crush Tracker (previously known as "Secret Crushes") is a Facebook application that allows users to secretly place crushes on their friends. If two people have a crush on each other, the application notifies both of them.
The UniWiki is a series of wikis for university students.
My Old Website for anyone who wants to reminisce about high school (... with me, presumably).
My research interests are machine learning, common sense reasoning, information extraction, machine reading, knowledge representation, and their applications in AI and NLP. I think all of these areas have important insight into the problem of building human-level intelligence.
I'm also interested in algorithms, complexity theory, and cryptography, though they aren't my primary research interests.
I work on the Never-Ending Language Learner, a system which learns to read using a corpus of webpages. More to come here...
Analogies are a general comparison mechanism that are commonly believed to be central to human thinking (see "Metaphors We Live By" by Lakoff and Johnson). We use analogies to reason about unfamiliar situations and solve problems efficiently.
My Master's thesis introduces CrossBridge, a novel analogy algorithm that uses statistical information from a large corpus and dimensionality reduction to improve analogy retrieval in sparse data sets. In my thesis, I compare CrossBridge to structure mapping and show that CrossBridge is more efficient and robust.
Applications for CrossBridge could include case-based reasoners, teaching applications, and various NLP tasks.