janmisek

var walked = [];

var searchHaystack = function(haystack, needle, path, exactEquals) {

  //dumb truthiness handling
  exactEquals = exactEquals ? true : false;

  if(typeof haystack != "object") {
    console.warn("non-object haystack at " + path.join("."));
    return [false, null];

Integralist

• Install
• Shell exports
• Directory explanations
• Automatic Imports
• Private repo access
• Guard (automatic go run)
• Godo
• Spurious
• AWS SDK with Go (inc. some old possibly broken examples)
• Build and Compilation

ciaranarcher

Types

type Vertex struct {
    Lat, Long float64
}

Maps

debasishg

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

rxaviers

People

:bowtie:	😄 :smile:	😆 :laughing:
😊 :blush:	😃 :smiley:	☺️ :relaxed:
😏 :smirk:	😍 :heart_eyes:	😘 :kissing_heart:
😚 :kissing_closed_eyes:	😳 :flushed:	😌 :relieved:
😆 :satisfied:	😁 :grin:	😉 :wink:
😜 :stuck_out_tongue_winking_eye:	😝 :stuck_out_tongue_closed_eyes:	😀 :grinning:
😗 :kissing:	😙 :kissing_smiling_eyes:	😛 :stuck_out_tongue: