Chapter Meetups

Introduction to Projective Geometry

Map Date/Time: 2017-10-14 02:00pm Location: HasGeek House - #2699, 19th Main, 5th Cross, Indiranagar HAL 2nd Stage, Bangalore, Bangalore

Paper: An Introduction to Projective Geometry

Agenda

3D Computer Vision is the area of Computer Vision that studies how we can recreate 3D images of a 3D object, as opposed to normal cameras that create a 2D image of a 3D object. Application of this is abundant today: from Apple X's Augmented Reality applications, 3D Facial Recognition to latest news today Google Pixel use of Depth in images to create bokeh/Portrait images. Projective Geometry is the bread and butter of 3D Computer Vision. During this talk, we will see how Projective Geometry allows us to model the imaging process of a camera. Projective Geometry allows much more richer transformations than just translation and rotation possible in Euclidean Geometry. We will discuss how we can use Projective Geometry for various Computer Vision Problems: like Stereo, 3D Reconstruction etc.

It is a Joint session of Bangalore Co…

Read more about this Meetup

An incremental approach to compiler construction

Map Date/Time: 2017-09-09 03:00pm Location: Fitkids education and training - No 73/1. Millers road, Near Vikram Hospital, Opp St. Ann's school, Vasanth Nagar, Bangalore

I find this paper by Abdulaziz Ghuloum extremely elegant and one of the most approachable introductions to compiler construction. I hope to present and demo a small compiler built in 24 incremental steps where each step is simple enough to grasp easily.

Paper http://scheme2006.cs.uchicago.edu/11-ghuloum.pdf

Read more about this Meetup

Scalable Component Abstractions with Manohar

Map Date/Time: 2017-05-13 03:00pm Location: Cognizant Technology Solutions, - Bagmane Tech Park, CV Raman Nagar, Bangalore, Bangalore

Manohar Jonnalagedda will talk about Scalable Component Abstractions
by Odersky and Zenger, published at OOPSLA 2005. He recently finished his PhD from Odersky's lab. 

The paper that goes through 3 main features of the Scala language, and could arguably be considered as one of the base papers.

http://dl.acm.org/citation.cfm?id=1094815

Read more about this Meetup

A statistical approach to machine translation with Abhaya Agarwal

Map Date/Time: 2017-02-04 03:00pm Location: Instamojo - 4th floor, Maa grace building, Koramanagala, Bangalore

We will be discussing the classic paper which kickstarted the area of Statistical Machine Translation.


http://www.ling.upenn.edu/courses/Spring_2011/cogs502/Brown1990.pdf

The following is a explanatory document discussing the translation models, EM algorithm and provides mathematical proofs:  http://www.cs.columbia.edu/~mcollins/courses/nlp2011/notes/ibm12.pdf

And finally, these are slides discussing the same material but with more examples and easier to understand: http://www.statmt.org/book/slides/04-word-based-models.pdf

Read more about this Meetup

CRDT: Conflict-free replicated data types

Map Date/Time: 2017-01-21 03:00pm Location: Concur Technologies, 3rd Floor, B-block, Bagmane Laurel - Bagmane Tech Park, Bysandra, C V Raman Nagar, Bangalore

Abstract:  Eventual consistency aims to ensure that replicas of some mutable shared object converge without foreground synchronisation. Previous approaches to eventual consistency are ad-hoc and error-prone. We study a principled approach: to base the design of shared data types on some simple formal conditions that are sufficient to guarantee eventual consistency. We call these types Convergent or Commutative Replicated Data Types (CRDTs).

Reference Paper:  A comprehensive study of Convergent and Commutative Replicated Data Types

Overview: Replication is a fundamental concept of distributed systems. Any data update must be replicated to all peers in the system, if the system were to behave like a single system. This is usually achieved  by introducing coordination, but it is expensive and can become infeasible quickly. An alternative approach is to build systems that are eventually co…

Read more about this Meetup

Rsync and CAP

Map Date/Time: 2016-12-10 03:00pm Location: GoJek - Tower B, 4th Floor, Diamond District, H A L Old Airport Road, ISRO Colony, Domlur, Bangalore

We have a meetup after a long break!

We are trying an alternate format for our talks and from now onward we will have multiple short talks instead of one long one. You can read more about the reasons to do so here.

http://jaseemabid.github.io/2016/11/24/pwl.html


Ramki will talk about Rsync.


Paper: https://www.cs.cmu.edu/~15-749/READINGS/required/cas/tridgell96.pdf

Anand Pillai will talk about CAP theorem and here is the reading material.

1. This is the closest to "original paper" I could find. The idea was first proposed by Brewer in a talk.
   Lessons from Giant-Scale Services,   

Read more about this Meetup

FLP: Impossibility of Distributed Consensus with One Faulty Process by Vaidhy

Map Date/Time: 2016-04-09 02:00pm Location: Codemancers Pvt Ltd - 648/A-3, 1st floor, Binnamangala 1st stage, Hoysala nagar, Indiranagar, Bangalore - 560038 , Bengaluru

Vaidhy will be presenting the famous FLP paper in distributed systems:


Fischer Lynch Paterson wrote a paper on Impossibility of Distributed Consensus with One Faulty Process :


https://groups.csail.mit.edu/tds/papers/Lynch/jacm85.pdf

Kashyap: Meetup.com's geolocation is kind of screwed up. Use this Gmaps link for directions on your mobile: https://goo.gl/maps/ikM7ekWGmUS2. The office is near the junction of Old Madras Road and IndiraNagar 100ft Road. Call [masked] for clarification. If you're heading towards old madras road on the 100ft Road, it's the last lane on the left side.

Read more about this Meetup

Gradual Typing for Functional Languages

Map Date/Time: 2016-03-19 03:00pm Location: IISc bangalore - CV raman road bangalore, Bangalore

I hope to present one of the earliest papers on Gradual Typing. 
We will start with the basics. 

• Various approaches of typing and the differences. 

• Static, Gradual, Optional etc 

• Contrast static and run time guarantees/behavior of untyped and typed lambda calculus 

• Learn the Notation in Programming Language Theory 

 We will also look into other candidates in this space and what they do differently - like flowtype for js, typed racket, mypy etc. 

 Paper: http://ecee.colorado.edu/~siek/pubs/pubs/2006/siek06_gradual.pdf 

Supplementary reading: 

• http://wphomes.soic.indiana.edu/jsiek/…

Read more about this Meetup

Meet Dr. Shriram Krishnamurthi

Map Date/Time: 2016-01-17 08:00pm Location: Citrus Cunningham - 34, Cunningham Road, Vasanth Nagar, Bangalore

Shriram is back at Bangalore and has agreed to give a talk on 17th Jan, Sunday evening.

Unlike other meetings, we *do not* have any reading material. Come with an open mind.

Talk Abstract:

The Recurring Rainfall Problem

Soloway's Rainfall problem, a classic benchmark in computing education research, has proven difficult for many CS1 students.  Rainfall tests students' abilities at plan composition, the task of integrating code fragments that implement subparts of a problem into a single program. Nearly all prior studies of Rainfall have involved students who were learning imperative programming with arrays.  In our recent multi-university study, students learning functional programming produced atypical profiles of compositions and errors on Rainfall. What do these different results suggest about the problem of plan composition and programming education?

This talk raises various questions about the relationships between programming languages, progr…

Read more about this Meetup

Shor's Algorithm - Part 2

Map Date/Time: 2016-01-09 02:00pm Location: InMobi - 7th Floor, Block Delta, B Block, Embassy Tech Square, Outer Ring Road, Bangalore

Shor's Algorithm - Part 1

Map Date/Time: 2016-01-02 02:00pm Location: InMobi - 7th Floor, Block Delta, B Block, Embassy Tech Square, Outer Ring Road, Bangalore

Paper: By Peter M. Shor


http://arxiv.org/abs/quant-ph/9508027v2

Speaker: Anita SV.

We will restrict this to just the introduction to Quantum Mechanics and Qubits. 

Location: Ask for Cafeteria @ Inmobi office.


Link to Part 2: 

http://www.meetup.com/Papers-we-love-Bangalore/events/226999354/

Pre-requisites: Complex Numbers, Vectors, Trigonometry. 

Good To Know: Fourier Transform, Number Theory.

Bonus: Linear Algebra, Hilbert Spaces, Quantum Mechanics.

Read more about this Meetup

Let's Shazaam with Arpit Mohan

Map Date/Time: 2015-12-12 03:00pm Location: 91Springboard -Bangalore - 4th Floor, No 22, Salarpuria Towers(tower 1),Hosur Main Road, Kormangala 5600, Below Janshree News, Above BigBazaar, Bangalore

A Geocoding Algorithm Based On A Comparative Study with Shravanthi

Map Date/Time: 2015-11-07 03:00pm Location: Near Pvt Ltd, 4th Floor, 71/72, Jyothi Nivas College Road, - Koramangala 5th Block, Bangalore

Log-structured merge-tree with Sreekanth Vadagiri

Map Date/Time: 2015-10-24 03:00pm Location: HasGeek House - #2699, 19th Main, 5th Cross, Indiranagar HAL 2nd Stage, Bangalore, Bangalore

I plan to cover 2  papers. But the focus will definitely on the LSM-Tree paper.

The Log-Structured Merge-Tree (LSM-Tree)

As a brief intro will start with the B trees probably from (The ubiquitous B tree)

If people are intersted, I can show code for the some of the above.

Some knowledge of Database Internals and some basic algorithms is expected.


The reason this paper is important, is because most modern databases use either of the two ways for storing data.

I have started to create a Reading Helper for Reading the paper. It is here. If you are reading the paper and are confused about things  please make a comment and I will update it.

Read more about this Meetup

Overlapping Experiment Infrastructure with Srihari & Nivedita

Map Date/Time: 2015-10-10 03:00pm Location: Red Hat India Pvt. Ltd - Office Address # 4/1, Bannerghatta Road IBC Knowledge Park 11th floor, Tower D Bangalore - 560 029, Bangalore , Bangalore

Wait Free Synchronization - Maurice Herlihy

Map Date/Time: 2015-08-15 10:00am Location: Idea Device - Gayatri Mansion, Parijatha Avenue, Bellandur. Landmark: Above Ravindu Toyota, Bangalore

Hyperloglog

Map Date/Time: 2015-03-14 03:00pm Location: Idea Device - Gayatri Mansion, Parijatha Avenue, Bellandur. Landmark: Above Ravindu Toyota, Bangalore

I will be talking about Hyperloglog, a cardinality (i.e. number of distinct elements) estimation algorithm. In general, counting the number of elements in a set gets harder as the number of sets increase. For e.g., you might want to count number of users from a country.. i.e. number of sets is just 200+ and you can use a map of country to count. But, if you want to count the number of unique visitors to a popular website, then the number of sets become really large.

Probabilistic counting methods give a way to estimate the cardinality of sets without keeping track of every single item. Hyperloglog is probably the best known of those methods. 

Paper: http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf

Read more about this Meetup

"Data Structures for Text Sequences"

Map Date/Time: 2015-01-31 03:00pm Location: Idea Device - Gayatri Mansion, Parijatha Avenue, Bellandur. Landmark: Above Ravindu Toyota, Bangalore

Ashok Gautham will be talking about the paper "Data Structures for Text Sequences" by Charles Crowley. 

https://www.cs.unm.edu/~crowley/papers/sds.pdf

Read more about this Meetup

"Tierless Programming and Reasoning for Software-Defined Networks"

Map Date/Time: 2015-01-10 10:00am Location: Citrus Cunningham - 34, Cunningham Road, Vasanth Nagar, Bangalore

Prof. Shriram Krishnamurthi will be talking about his recent research on software defined networks and around the paper he co-authored "Tierless Programming and Reasoning for Software-Defined Networks". A link to the paper is here: http://cs.brown.edu/~adf/work/NSDI2014-paper.pdf

Some material to understand the paper better:

1. Introduction to the domain, helps to get a brief idea before diving into the paper. http://blog.brownplt.org/2014/09/30/flowlog1.html

2. Video lecture: https://www.usenix.org/conference/nsdi14/technical-sessions/presentation/nelson

3. Th…

Read more about this Meetup

Functional Geometry

Map Date/Time: 2014-12-13 03:00pm Location: Idea Device - Gayatri Mansion, Parijatha Avenue, Bellandur. Landmark: Above Ravindu Toyota, Bangalore

Functional Geometry - http://users.ecs.soton.ac.uk/peter/funcgeo.pdf and http://eprints.soton.ac.uk/257577/1/funcgeo2.pdf

<rant>

Imperative programming is rooted in compulsively thinking of programs as a sequence of instructions given to a machine that manipulates a set of bits. Bits represent state: each bit can be in 2 states, 10 bits in 1024 states, a 100 in 1e301 states. No matter whatever high level abstractions you create for talking about these primitive bits (floats, points, lines, boxes, polygons, fish), as long as you are writing programs that work with state, you are bound to run into this combinatorial explosion as you add complexity. We humans are really bad at keeping track of states in our heads! An average person can keep

Read more about this Meetup

Paxos paper discussion by Vaidhy/Anita.

Map Date/Time: 2014-12-06 11:00am Location: Nilenso Software LLP - #105, 10th Cross, Indiranagar Stage 1, Bangalore

Vaidhy discussed Raft today (29th). He will followup on the Paxos paper by Leslie Lamport.

Read more about this Meetup

Raft/Paxos and other consensus algorithms

Map Date/Time: 2014-11-29 03:00pm Location: Nilenso Software LLP - #105, 10th Cross, Indiranagar Stage 1, Bangalore

 Paxos and Raft are two algorithms for getting one answer from a group of unreliable processors. Some of the more popular use-cases for such algorithms are leader election, distributed locking, distributed log replication and so on.

Paxos was originally presented by Leslie Lamport in a very entertaining paper (that was rejected for publication many times). However, generalized Paxos is considered extremely hard to implement. 

Raft was born as a easy to understand consensus algorithm and had several implementations to its credit. 

In this session, I am planning to go over the problem of distributed log replication, walk through Paxos and its derivatives and then go through Raft. We can take a quick shot at implementing it, if time permits. 

Read more about this Meetup

Meetup #2 - QuickCheck by Naren Sundaravaradan

Map Date/Time: 2014-10-11 03:00pm Location: Idea Device - Gayatri Mansion, Parijatha Avenue, Bellandur. Landmark: Above Ravindu Toyota, Bangalore

Naren will be talking about the QuickCheck paper from John Hughes: http://www.cs.tufts.edu/~nr/cs257/archive/john-hughes/quick.pdf 

slides and code:

http://nanonaren.wordpress.com/2014/10/11/quickcheck/


More details:

Many of you have mentioned about this clashing with a talk at FuConf on property-based testing but I suggest we go through with this because I not only plan to cover QuickCheck but also motivate the topic with a little generality with respect to functional programming (to cater to those with a background mainly in imperative languages). Here is an outline of things I will cover

Each of these below will be illustrated with plenty of code examples


- Why are tests ne…

Read more about this Meetup

First Meetup - "A micro-manual for LISP -- not the whole truth"

Map Date/Time: 2014-09-13 03:00pm Location: Idea Device - Gayatri Mansion, Parijatha Avenue, Bellandur. Landmark: Above Ravindu Toyota, Bangalore

We will discuss and implement John McCarthy's 1978 paper "A Micro-manual for LISP -- not the whole truth".


http://www.ee.ryerson.ca/~elf/pub/misc/micromanualLISP.pdf

Please read up the paper and work through it before coming into the meeting so that everyone benefits from the collective knowledge. The meetup will be very informal.

Read more about this Meetup