Are you over 18 and want to see adult content?
More Annotations
A complete backup of timesofindia.indiatimes.com/india/five-sc-judges-catch-h1n1-right-to-religion-hearing-gets-derailed/article
Are you over 18 and want to see adult content?
A complete backup of www.espn.com/soccer/report?gameId=560960
Are you over 18 and want to see adult content?
A complete backup of www.hln.be/nieuws/binnenland/grote-stroompanne-in-oost-vlaanderen-na-17-minuten-opgelost-maar-check-wel-eve
Are you over 18 and want to see adult content?
A complete backup of www.lifo.gr/now/greece/271546/eody-ola-osa-prepei-na-gnorizete-gia-ton-neo-koronaio-pos-metadidetai-poia-ei
Are you over 18 and want to see adult content?
Favourite Annotations
A complete backup of modenaskaraa.tumblr.com
Are you over 18 and want to see adult content?
A complete backup of marathisrushti.com
Are you over 18 and want to see adult content?
A complete backup of portalvallenato.net
Are you over 18 and want to see adult content?
A complete backup of ensaremigio.blogspot.com
Are you over 18 and want to see adult content?
Text
AKSHAY ~ GOOGLE
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-HYPERCOMPUTATION
HYPERCOMPUTATION: Introduction It has long been assumed that Turing Machine is a sufficient model for computing. Anything that is computable can be simulated by a Turing Machine.AKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT Kanpur UPLIFT MODELING : PREDICTING INCREMENTAL GAINS Uplift Modeling : Predicting incremental gains Akshay Kumar, Rishabh Kumar CS229 jStanford University j12/11/2018 Introduction and Motivation - Uplift modelling: NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract GOOGLE SIMILARITY DISTANCEWEB VIEW Information Distance. E(x, y) : Given two strings x and y, the length of the shortest binary program, in the reference universal computing system, such that the program computes output y from input x, and also output x from input y is known as the information distance between x and y Up to a negligible logarithmic additive term, 𝐸𝑥, 𝑦=𝐾𝑥, 𝑦−min{𝐾𝑥, 𝐾(𝑦)} LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSHAY ~ GOOGLE
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-HYPERCOMPUTATION
HYPERCOMPUTATION: Introduction It has long been assumed that Turing Machine is a sufficient model for computing. Anything that is computable can be simulated by a Turing Machine.AKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT Kanpur UPLIFT MODELING : PREDICTING INCREMENTAL GAINS Uplift Modeling : Predicting incremental gains Akshay Kumar, Rishabh Kumar CS229 jStanford University j12/11/2018 Introduction and Motivation - Uplift modelling: NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract GOOGLE SIMILARITY DISTANCEWEB VIEW Information Distance. E(x, y) : Given two strings x and y, the length of the shortest binary program, in the reference universal computing system, such that the program computes output y from input x, and also output x from input y is known as the information distance between x and y Up to a negligible logarithmic additive term, 𝐸𝑥, 𝑦=𝐾𝑥, 𝑦−min{𝐾𝑥, 𝐾(𝑦)} LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSHAY ~ GOOGLE
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .AKSHAY ~ GOOGLE
Predictive Lift modelling : Predicting incremental gains Course Project in CS229: Machine Learning (September - December 2018) Designed a predictive response model using uplift modelling technique to predict the “incremental” effect of an ad campaign on consumer behavior and use it to target the optimal set of customers.AKSHAY ~ GOOGLE
Akshay Kumar, Google. PCA: Complementation and Model Checking. Mentored by Prof. Paul Gastin & Benedikt Bollig at LSV, ENS Cachan (May - July 2014) We study the language-theoretical aspects of parameterized communicating automata (PCAs), in which processes communicate via rendez-vous.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Given an instance of Hamiltonian Cycle Problem, construct an instance of TSP as follows:. is a complete graph. For all edges , .. For other edges, where . If has a hamiltonian cycle, .Otherwise, the tour must include an edge of weight . NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of UPLIFT MODELING : PREDICTING INCREMENTAL GAINS Uplift Modeling : Predicting incremental gains Akshay Kumar akshayk@stanford.edu Rishabh Kumar rkumar92@stanford.edu December 2018 1 Abstract Marketing strategies directed to random cus-AKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT KanpurAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryofAKSHAY ~ GOOGLE
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-AKSHAY ~ GOOGLE
Akshay Kumar, Google. Given an instance of Hamiltonian Cycle Problem, construct an instance of TSP as follows:. is a complete graph. For all edges , .. For other edges, where . If has a hamiltonian cycle, .Otherwise, the tour must include an edge of weight .AKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof UPLIFT MODELING : PREDICTING INCREMENTAL GAINS Uplift Modeling : Predicting incremental gains Akshay Kumar, Rishabh Kumar CS229 jStanford University j12/11/2018 Introduction and Motivation - Uplift modelling: NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSHAY ~ GOOGLE
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-AKSHAY ~ GOOGLE
Akshay Kumar, Google. Given an instance of Hamiltonian Cycle Problem, construct an instance of TSP as follows:. is a complete graph. For all edges , .. For other edges, where . If has a hamiltonian cycle, .Otherwise, the tour must include an edge of weight .AKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof UPLIFT MODELING : PREDICTING INCREMENTAL GAINS Uplift Modeling : Predicting incremental gains Akshay Kumar, Rishabh Kumar CS229 jStanford University j12/11/2018 Introduction and Motivation - Uplift modelling: NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSHAY ~ GOOGLE
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Stanford University Artificial Intelligence Graduate Certificate (2017–present) GPA of 3.8 (on a scale of 4). Indian Institute of Technology, Kanpur MTech in Computer Science & Engineering(2010–2015)
AKSHAY ~ GOOGLE
Publication. B. Bollig, P. Gastin and A. Kumar.Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), New Delhi, India, December 2014, Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik.AKSHAY ~ GOOGLE
Hand Gesture Recognition using Kinect Presentation as part of course project of CS365 (Artificial Intelligence) Segmented the shape of hand output by Kinect and used it to determine the shape of gesture using FEMD (Field Earth Mover Distance).AKSHAY ~ GOOGLE
Predictive Lift modelling : Predicting incremental gains Course Project in CS229: Machine Learning (September - December 2018) Designed a predictive response model using uplift modelling technique to predict the “incremental” effect of an ad campaign on consumer behavior and use it to target the optimal set of customers.AKSHAY ~ GOOGLE
TA (Teaching Assistant) for the course of Topics in Linear programming (CS698J/R) in a batch of nearly 60 students. Designed an app Let's Meet in Yahoo HackU’ 13 using Google Maps API which suggests a cluster of distinct type of meeting places in proximity based on input provided by a group of users. NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study ofAKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT Kanpur CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED canrateanotheruserbetween-10(extremelydistrustful)to+10(totallytrustful)inincrementsof +1units. Boththenetworksaredirectedandweighted. Bitcoin-alphahas3,783nodesand24,186 LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSH04AY.GITHUB.IO
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver- NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSH04AY.GITHUB.IO
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver- NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSHAY ~ GOOGLE
Stanford University Artificial Intelligence Graduate Certificate (2017–present) GPA of 3.8 (on a scale of 4). Indian Institute of Technology, Kanpur MTech in Computer Science & Engineering(2010–2015)
AKSHAY ~ GOOGLE
Publication. B. Bollig, P. Gastin and A. Kumar.Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), New Delhi, India, December 2014, Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik.AKSHAY ~ GOOGLE
Hand Gesture Recognition using Kinect Presentation as part of course project of CS365 (Artificial Intelligence) Segmented the shape of hand output by Kinect and used it to determine the shape of gesture using FEMD (Field Earth Mover Distance).AKSHAY ~ GOOGLE
Predictive Lift modelling : Predicting incremental gains Course Project in CS229: Machine Learning (September - December 2018) Designed a predictive response model using uplift modelling technique to predict the “incremental” effect of an ad campaign on consumer behavior and use it to target the optimal set of customers.AKSHAY ~ GOOGLE
TA (Teaching Assistant) for the course of Topics in Linear programming (CS698J/R) in a batch of nearly 60 students. Designed an app Let's Meet in Yahoo HackU’ 13 using Google Maps API which suggests a cluster of distinct type of meeting places in proximity based on input provided by a group of users.AKSHAY ~ GOOGLE
Akshay Kumar, Google. PCA: Complementation and Model Checking. Mentored by Prof. Paul Gastin & Benedikt Bollig at LSV, ENS Cachan (May - July 2014) We study the language-theoretical aspects of parameterized communicating automata (PCAs), in which processes communicate via rendez-vous.1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-AKSHAY ~ GOOGLE
Akshay Kumar, Google. Given an instance of Hamiltonian Cycle Problem, construct an instance of TSP as follows:. is a complete graph. For all edges , .. For other edges, where . If has a hamiltonian cycle, .Otherwise, the tour must include an edge of weight .AKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryofAKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT KanpurAKSH04AY.GITHUB.IO
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver- NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSH04AY.GITHUB.IO
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver- NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSHAY ~ GOOGLE
Stanford University Artificial Intelligence Graduate Certificate (2017–present) GPA of 3.8 (on a scale of 4). Indian Institute of Technology, Kanpur MTech in Computer Science & Engineering(2010–2015)
AKSHAY ~ GOOGLE
Publication. B. Bollig, P. Gastin and A. Kumar.Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), New Delhi, India, December 2014, Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik.AKSHAY ~ GOOGLE
Hand Gesture Recognition using Kinect Presentation as part of course project of CS365 (Artificial Intelligence) Segmented the shape of hand output by Kinect and used it to determine the shape of gesture using FEMD (Field Earth Mover Distance).AKSHAY ~ GOOGLE
Predictive Lift modelling : Predicting incremental gains Course Project in CS229: Machine Learning (September - December 2018) Designed a predictive response model using uplift modelling technique to predict the “incremental” effect of an ad campaign on consumer behavior and use it to target the optimal set of customers.AKSHAY ~ GOOGLE
TA (Teaching Assistant) for the course of Topics in Linear programming (CS698J/R) in a batch of nearly 60 students. Designed an app Let's Meet in Yahoo HackU’ 13 using Google Maps API which suggests a cluster of distinct type of meeting places in proximity based on input provided by a group of users.AKSHAY ~ GOOGLE
Akshay Kumar, Google. PCA: Complementation and Model Checking. Mentored by Prof. Paul Gastin & Benedikt Bollig at LSV, ENS Cachan (May - July 2014) We study the language-theoretical aspects of parameterized communicating automata (PCAs), in which processes communicate via rendez-vous.1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-AKSHAY ~ GOOGLE
Akshay Kumar, Google. Given an instance of Hamiltonian Cycle Problem, construct an instance of TSP as follows:. is a complete graph. For all edges , .. For other edges, where . If has a hamiltonian cycle, .Otherwise, the tour must include an edge of weight .AKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryofAKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT KanpurAKSH04AY.GITHUB.IO
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver- NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSH04AY.GITHUB.IO
Akshay Kumar, Google. Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube.AKSHAY ~ GOOGLE
Akshay Kumar, Google. Stanford AI Certification. CS229: Machine Learning. CS231N: Convolutional Neural Networks for Visual RecognitionAKSHAY ~ GOOGLE
A few days ago, I watched a lecture of Madhur Tulsiani on multiplicative weight update method and its applications to solving LPs. In this post, I am going to briefly describe about this. You can find the talk here.. Problem Statement. Consider a system of experts labelled .There's a player who chooses an expert, say , and bears a loss equal to the loss of expert .1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver- NETWORK ANALYSIS OF WEIGHTED SIGNED BITCOIN NETWORKS Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying CS 224W: Analysis of Networks Class Project Introduction This project involves the study of CS 224W PROJECT REPORT NETWORK ANALYSIS OF WEIGHTED SIGNED CS 224W Project Report Network Analysis of Weighted Signed Bitcoin Networks Akshay Kumar, Vincent Ying December 11, 2017 Abstract FACE SWAPPING AND HARMONIZATION USING NEURAL NETS Face swapping and harmonization using neural nets Akshay Kumar (akshayk@stanfoed.edu) CS 231N: Convolutional Neural Networks forVisual Recognition
GAME INTERPRETATION OF ALGORITHMIC INFORMATION THEORY 1.00000000001111111111 2.10010101101111001011 The rst string as be described more succintly as : \ten 0’s followed by ten 1’s". However, there’s noAKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryof LIMITING THE SPREAD OF RUMORS IN A NETWORKWEB VIEW Problem Statement. Given a rumor/negative campaign in a social network, identify nodes critical to its flow and design a mechanism tocontrol the spread.
AKSHAY ~ GOOGLE
Stanford University Artificial Intelligence Graduate Certificate (2017–present) GPA of 3.8 (on a scale of 4). Indian Institute of Technology, Kanpur MTech in Computer Science & Engineering(2010–2015)
AKSHAY ~ GOOGLE
Publication. B. Bollig, P. Gastin and A. Kumar.Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’14), New Delhi, India, December 2014, Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik.AKSHAY ~ GOOGLE
Hand Gesture Recognition using Kinect Presentation as part of course project of CS365 (Artificial Intelligence) Segmented the shape of hand output by Kinect and used it to determine the shape of gesture using FEMD (Field Earth Mover Distance).AKSHAY ~ GOOGLE
Predictive Lift modelling : Predicting incremental gains Course Project in CS229: Machine Learning (September - December 2018) Designed a predictive response model using uplift modelling technique to predict the “incremental” effect of an ad campaign on consumer behavior and use it to target the optimal set of customers.AKSHAY ~ GOOGLE
TA (Teaching Assistant) for the course of Topics in Linear programming (CS698J/R) in a batch of nearly 60 students. Designed an app Let's Meet in Yahoo HackU’ 13 using Google Maps API which suggests a cluster of distinct type of meeting places in proximity based on input provided by a group of users.AKSHAY ~ GOOGLE
Akshay Kumar, Google. PCA: Complementation and Model Checking. Mentored by Prof. Paul Gastin & Benedikt Bollig at LSV, ENS Cachan (May - July 2014) We study the language-theoretical aspects of parameterized communicating automata (PCAs), in which processes communicate via rendez-vous.1 INTRODUCTION
Parameterized Algorithms for Cycle Hitting Problems Date: July 8, 2015 Instructor: S K Mehta Akshay Kumar Abstract In this paper, we consider two di erent problems of computing the minimum set of ver-AKSHAY ~ GOOGLE
Akshay Kumar, Google. Given an instance of Hamiltonian Cycle Problem, construct an instance of TSP as follows:. is a complete graph. For all edges , .. For other edges, where . If has a hamiltonian cycle, .Otherwise, the tour must include an edge of weight .AKSH04AY.GITHUB.IO
References 1.Arora,Sanjeev,andSatyenKale. “Acombinatorial, primal-dualapproachtosemidefiniteprograms.” Proceedings ofthethirty-ninthannualACMsymposiumonTheoryofAKSHAY KUMAR
Concentration Bounds for Absolutely Normal Real Numbers July 2013 - April 2014 Bachelors Project under guidance of Prof. Satyadev Nandakumar IIT Kanpuracademics
Home
Academics
Publications
Talks Given
Course Work
Achievements
Resume
projects
Research Internships Software Internship Research ExperienceSelect Projects
others
Extracurrics
Contact
technical writings
MMW
UGC
AKSHAY KUMAR
Akshay Kumar (aksh04ay@gmail.com)Akshay Kumar
Software Engineer
Google LLC
Mountain View, CA, USA Hi! I am a Software Engineer at Google Mountain View. I work on problems related to measurement and optimization of effectiveness of ads on Youtube. I am more broadly interested in auctioning, bidding, budgeting and prediction modeling for ads on YouTube. Prior to moving to Mountain View, I was at Google London where I worked on Google AdSense. Before that, I graduated from IIT Kanpur with a Bachelor's and Master's Degree in Computer Science in July 2015. Currently, I am also doing a grad AI certification from StanfordUniversity.
This webpage has been generated using jemdoc : a light text-based text markup language which converts a jemdoc markup to static websites. Page generated 2019-01-02 22:23:41 PST, by jemdoc. (source )
Details
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0