[MapR Talk] Doing the Impossible, Almost

Document created by aalvarez on Dec 1, 2015Last modified by aalvarez on Dec 7, 2015
Version 3Show Document
  • View in full screen mode

Overview

In an effort to help grow organic communities interested in new technologies, MapR speakers around the world provide technical talks on numerous topics. Please browse our MapR Talks Directory  to learn how to search and request a talk in seconds.

 

Abstract

Computing various quantities such as medians or the number of unique elements requires a lot of time or a lot of memory or both. It is, however, possible to get really close to the exact answer with much less time and much less memory. Some of these algorithms are much simpler than you might expect. I will describe a selection of these algorithms including some not yet published algorithms.

 

We will also outline how these algorithms can be applied to practical problems like anomaly detection.

 

KEYWORDS: Streaming algorithms

 

Location Availability & Request Link

North America. Please refer to theMapR Talks Directory  for specific countries.

You can request this talk here: Speaker Request

 

Related Resources

Find all Meetups and Events resources.

Find all MapR Talks: mapr talk

Learn more about Mapr Talks and how to book a speaker: Meetup and Event Organizers Resources

Attachments

    Outcomes