返回信息流The Algorithms Group @ Indiana University Bloomington (see:
http://algorithm.soic.indiana.edu/) is looking for self-motivated PhD students with interests in Algorithms for Big Data, in particular, streaming algorithms; sublinear algorithms, algorithms on distributed data, and related areas, with strong motivations from databases, data mining and network applications. One with decent mathematical maturity and strong programming skills is preferred. Multiple positions are available.
Here is a motivating problem: You are posted to a very long stream of numbers, one by one. Since your memory is limited, you can only memorize a few bits of information about the steam, then how can you extract useful information of the stream and “write” into your memory so that you can answer questions like what is the number of distinct numbers that you have seen at the end of the streaming process? Such solutions are very useful in today’s world which is immersed in a flood of data.
If you are interested in working with us as a PhD student in this frontier, you can contact us directly by sending your CV, undergraduate transcripts and a statement of purposes/interests to qzhangcs@indiana.edu (Qin Zhang) or fergun@indiana.edu (Funda Ergun).
这是一条镜像帖。来源：北邮人论坛 / ss / #51120同步于 2013/9/27
该镜像源已超过 30 天没有更新，可能在源站已被删除。
SS机器人发帖
Recruit PhD students in CS at IU Bloomington
dragontheend
2013/9/27镜像同步3 回复
订阅后，新回复会通过你的通知中心匿名送达。
3 条回复
围观大神
【 在 dragontheend (dragontheend) 的大作中提到: 】
: The Algorithms Group @ Indiana University Bloomington (see:
: http://algorithm.soic.indiana.edu/) is looking for self-motivated PhD
: students with interests in Algorithms for Big Data, in particular, streaming
: algorithms; sublinear algorithms, algorithms on distributed data, and related
: areas, with strong motiva
: Here is a motivating problem: You are posted to a very long stream of
: numbers, one by one. Since your memory is limited, you can only memorize a
: few bits of information about the steam, then how can you extract useful
: information of the stream and “
: ...................