Difference between revisions of "Main Page"
| Line 35: | Line 35: | ||
<br clear=all> | <br clear=all> | ||
| − | [[File: | + | [[File:Jianling_Wang.jpg|left|border]] |
<B>Jianling Wang</B>, TA for CS 7646<BR> | <B>Jianling Wang</B>, TA for CS 7646<BR> | ||
Graduate Student, College of Computing, Ga Tech<BR> | Graduate Student, College of Computing, Ga Tech<BR> | ||
Revision as of 16:52, 18 March 2016
Contents
Quantitative Software Research Group at Georgia Tech
The Quantitative Software Research Group investigates systematic algorithms for trading and investing. Our focus is on Machine Learning, but we are also interested in other types of algorithms that inform us about markets and trading.
Members of Our Group
Tucker Balch, Ph.D., Director, Quant Software Research Group
Professor, Interactive Computing, Georgia Tech
Instructor for CS 7646
Chief Scientist, Lucena Research, Inc.
website
Maria Hybinette, Ph.D.
Associate Professor, Computer Science, University of Georgia
David Byrd, Graduate Student and Head TA for CS 7646
Instructor for CS 7646, Summer 2016
Research Scientist, Interactive Media Technology Center, Georgia Tech
Brian Hrolenok, Ph.D. Student and Head TA
Multiagent Robotics and Systems Lab
website
Jianling Wang, TA for CS 7646
Graduate Student, College of Computing, Ga Tech
Alumni
Sourabh Bajaj, MSCS, Georgia Tech
Software Engineer, Coursera Inc
website
Devpriya Dave, MSCS, Georgia Tech
Analyst, Data Division, Morgan Stanley
website
Jayita Bhattacharya, MSCS, Georgia Tech
Software Engineer (Playlist), Pandora Media
Alexander Moreno, MSCS, Georgia Tech
Ph.D. student, Georgia Tech
website
Rohit Sharma, MS QCF, Georgia Tech
Blackrock Capital
Vishal Shekhar, MS QCF, Georgia Tech
Software Engineer, Axioma Inc.
website
Publications
- Moreno, Alexander, and Tucker Balch. "Speeding up large-scale financial recomputation with memoization." Proceedings of the 7th Workshop on High Performance Computational Finance. IEEE Press, 2014. (conference)
- Moreno, Alexander, and Tucker Balch. "Improving financial computation speed with full and subproblem memoization." Concurrency and Computation: Practice and Experience (2015). (Journal) [1]
