TLDRocket
Sign in
Latest Anthropic announces potential IPO — Startups Magazine Researchly Builds an A.I. Database of 7 Million DACH Companies — Trending Topics Tendos Raises €12 Million to Bring A.I. to Building Materials Makers — Trending Topics Ex-Thylander investors’ Cortas raises €1.47M to build an AI property m... — Tech Funding News China’s A.I. Stocks Have Lost 40 Percent in Four Months — Trending Topics SAP advances its autonomous enterprise push with smarter, governed Jou... — SiliconANGLE Strawberry: Sweden’s A.I. Browser Tries What OpenAI and Perplexity Cou... — Trending Topics Anthropic I.P.O.: A.I. Critics Accuse Founders of a Power Grab — Trending Topics

The AI intelligence platform

Every AI story that matters — and the intelligence behind it.

TLDRocket reads all relevant sources, removes duplicate coverage, and publishes a short neutral summary of every story, linking back to the original. Free, no spam, unsubscribe anytime.

Add to Slack

Every story also updates live profiles event timelines weekly rankings the AI Market Index

Thursday, 20 December 2018

OMSCS CS6601 (Artificial Intelligence) Review and Tips

Eugene Yan 7 years ago 32

A student completed Georgia Tech's CS6601 Artificial Intelligence course, which covers fundamental AI algorithms including search, Bayesian networks, decision trees, and hidden Markov models through six programming assignments and two lengthy take-home exams. The course required an average of 23 hours per week, with assignments worth 60% of the grade and exams (34 and 47 pages respectively) worth 35% combined. The student achieved second place in a Kaggle decision trees competition and found the rigorous curriculum more challenging than related courses in machine learning and computer vision.

The daily briefing

Every AI story that matters, in your inbox by 8am.

TLDRocket reads all relevant sources, removes duplicate coverage, and summarises the day in two minutes. Follow companies and topics for alerts, or get the briefing in Slack. Free, no spam, unsubscribe anytime.