LiFi: The Next Generation of
Wireless Communication
Akshit Tyagi
What is LiFi?
LiFi is an adaptation of WiFi, where
instead of RF we use the visible light
for transmitting signals
VLC: Visible Light Communication
Not the same as optic fibre
Parts of th
Deploying computer vision algorithms for object detection and modification calculation on
resource constrained devices, has given me invaluable experience. Working in the industry
with a startup on Deep Learning for backend use of an Android application,
Towards better word embeddings for polysemic words
Shikhar Murty, Sai Praneeth Reddy
cfw_shikhar.murty, [email protected]
Abstract
Word embeddings are utilized ubiquitously in NLP
tasks as a way to overcome sparsity as well as to encode
semantic and sy
COL380 23rd February 2017
Assignment-1
J. Shikhar Murty (2013EE10462)
I.
Problem 1
1) Both the histories are linearizable. The figure below shows the linearization points for the
histories which makes the histories consistent with the sequential specifica
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Computational Intractability: NP-complete problems
Problem(3-D matching): Given disjoint sets , , and each of
size , and given a set of triples (, , ), determine if there
exist a su
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Network Flow: Applications
Edge disjoint paths in undirected graphs
Network Flow: Applications
Problem: Given an undirected graph find the maximum
number of edge disjoint paths betw
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Topics
Greedy Algorithms
Divide and Conquer
Dynamic Programming
Network Flow
Computational intractability
Other topics: Linear Programming
Linear Programming
Linear Programming
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
Date: August 23, 2012
1. Let T be an minimum spanning tree of graph G. Given a connected subgraph H of G,
show that T H is contained in some minimum spanning tree of H.
2. Prove the fol
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Polynomial-time reductions:
Examples
3-SAT Vs Independent-set
Computational Intractability: Reduction
Problem(3-SAT): Given a set of clauses 1, , , each of
length at most 3, over a
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Network Flow: Applications
Team elimination
Network Flow: Applications
Problem: There are teams. Each team has a current
number of wins denoted by (). There are (, ) games
yet to be
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
1. Discuss remaining problems from the previous tutorial.
2. Consider the following problem:
CLIQUE: Given a graph G and an integer k, determine whether G has a clique
of size at least
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Dynamic Programming: Examples
Longest Common Subsequence
Dynamic Programming: Examples
Problem(longest common subsequence): Let and be strings of
characters. is of length and is of
Design and Analysis of Algorithms
Massachusetts Institute of Technology
Profs. Constantinos Daskalakis and Erik Demaine
May 8, 2013
6.046/18.410
Problem Set 6
Problem Set 6
This problem set is due at 11:59pm on Wednesday, May 8, 2013.
Both exercises and p
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
Semester-I (2012-13)
1. Review DFS. Run DFS on example graph and show back edges, and label each vertex
with the time at which it is visited.
2. Design an algorithm that uses DFS to fin
December 17, 2012
6.046J/18.410J
Final Exam Solutions
Design and Analysis of Algorithms
Massachusetts Institute of Technology
Profs. Srini Devadas and Ronitt Rubinfeld
Final Exam Solutions
Do not open this quiz booklet until you are directed to do so. Re
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
1. Discuss problems in last tutorial that were not covered.
2. Another algorithm for max-flow
Consider the following slightly changed version of the Ford-Fulkerson max-flow algorithm.
T
CSL 356: Analysis and Design of Algorithms (CSE, IIT Delhi, Semester I, 2012-13)
Major Exam
Name:
Entry number:
Always try to give algorithm with best possible running time. The points that you
obtain will depend on the running time of your algorithm. Fo
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
1. Discuss Homework-5
2. (Weak Duality) A linear programming problem in the standard form can be written in
short using the following vector notation:
LP1: Maximize (cT x),
subject to A
CSL 356: Analysis and Design of Algorithms (CSE, IIT Delhi, Semester I, 2012-13)
Homework 5
You have to discuss the running time of your algorithms. Always try to give algorithm
with best possible running time.
You are required to give proofs of correct
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Polynomial-time reductions:
Examples
Independent Set Vs Degree-3 Independent Set
Computational Intractability: Reduction
Problem(Deg-3-Independent set): Given a graph =
(, ) of boun
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Linear Programming
Solving LP
Linear Programming: Solving LP
(Complication 1) What if the initial basic solution is not a feasible
solution?
Pre-processing algorithm:
Given , check i
CSL 356: Analysis and Design of Algorithms (CSE, IIT Delhi, Semester I, 2011-12)
Major Exam
Name:
Entry number:
Always try to give algorithm with best possible running time. The points that you
obtain will depend on the running time of your algorithm. Fo
CSL 356: Analysis and Design of
Algorithms
Ragesh Jaiswal
CSE, IIT Delhi
Computational Intractability
NP-complete problems: -COLORING
Computational Intractability: NP-complete problems
Problem (-coloring): Given a graph , determine if is
-colorable.
-co
CSL 356: Analysis and Design of Algorithms (CSE, IIT Delhi, Semester I, 2012-13)
Homework 3
Always try to give algorithm with best possible running time. The points that you
obtain will depend on the running time of your algorithm. For example, a student
CSL 356: Analysis and Design of Algorithms (CSE, IIT Delhi, Semester I, 2012-13)
Homework 2
Always try to give algorithm with best possible running time. The points that you
obtain will depend on the running time of your algorithm. For example, a student
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
1. Discuss the remaining problems from the previous Tutorial.
2. (NP-complete problems) Solve the following problems from Chapter 8 of the TardosKleinberg book. 1
Problem 27.
Problem
444
Exercises
Chapter 7 Network Flow
l rn is to suggest variants of the Preow-lush
prob e h ractical running time without mining its
eed up tallitJhat the algorithm maintains the invariant
for
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
Date: August 14, 2012
1. You are given an undirected graph G = (V, E) with unit edge weights and nodes u, v V .
Design an algorithm that outputs the number of distinct shortest paths be
CSL 356: Analysis and Design of Algorithms
Instructor: Ragesh Jaiswal
1. Another algorithm for max-flow
Consider the following slightly changed version of the Ford-Fulkerson max-flow algorithm.
This algorithm is also due to Jack Edmonds and Richard Karp.