Proposal Fest - October 26, 2011

Ziskind, Room 261

Program

09:00
                      Welcome and coffee
                        First session chair: Motke Porat
09:30-9:40
 Nimrod Talmon:   Resilient Data Structures
09:45-9:55
 Yaniv Lubling   :   Exploring the organization of the mouse genome on a single cell level
10:00-10:10
 Evgeny Gelman:  Bayesian approach for finding motion primitives and solving the inverse kinematic problem for multi-joint motion.
10:15-10:25
 Tom Gur          :   On the Power of Merlin-Arthur Data Streams Algorithms
10:30-10:40
 Eldad Zinger    :  Hellman's algorithm - Time/Memory trade off
10:45-10:55
 Yair Daon       :  What is Ergodic theory and what is it good for?
11:00-11:15
                               Break
                         Second session chair: Elad Zinger
 11:15-11:25
 Motke Porat         : Zeros of Matrix Polynomials
11:30-11:40
 Inbal Rika             : Small-Size Mimicking Networks
 11:45-11:55
 Gilad Braunschvig :  Energy Efficiency Using Algorithms
12:00-12:10
  Jun Chen             : Interacting random walks
12:15-12:25
 Ori Maoz             : Neural Coding
12:30-13:30
                                 Lunch
                          Third session chair:  Gilad Braunschvig
 13:30-13:35
 Michel Nanikashvili : Tango - a dance of mathematical models
13:40-13:45
 Omer Ramote         : Reverse Ecology using Codon Bias
 13:45-13:55
  Roee David            : Coloring Modified  Random Vector k - colorable graphs
13:55-14:05
  Itai Gonshorovitz     : Flow problems in transaction networks
 14:05-14:15   Dan Friedman          : Motif Finding using Probabilistic graphical models of the Genome
 14:15-14:20  Jonathan Hermon        : On the six degree of separation on various networks
 14:20
                         Bus leaves to social activity -PAINTBALL !