CS Colloquium, 2005 - 2006

Meets on Sundays, 11:15-12:15, at Schreiber 309.


Fall Semester:

30.10

Nati Srebro

Maximum Margin Matrix Factorization

6.11

Scott Kirkpatrick

Medusa -- a generic structure for long-tailed random networks

13.11

Julia Kempe

Ingredients for Quantum Computing

20.11

John Langford

Learning Reductions Formalize Learning Intuition

27.11

Nir Piterman

Revisiting Safra's Determinisation of Automata on Infinite Words

4.12

Guy Kindler

On Gallager's problem: new lower-bounds for noisy communication

11.12

Gill Bejerano

The Human Genome: Solving a Million Mysteries

18.12

Robert Krauthgamer

Unstructured data: practical algorithms with rigorous analysis

25.12

Adnan Agbaria

Compiler-Driven Distributed Checkpointing

1.1

Hanuka

 

8.1

Ronen Basri

3D reconstruction by example

9.1

Ziv Bar Joseph

Data integration for understanding dynamic systems in the cell

15.1

Yosi Keller

The diffusion framework: a computational approach to data analysis and signal processing on data sets

22.1

Lihi Zelnik-Manor

Analysis of dynamic visual information

29.1

Yair Weiss

Solving NP-hard problems in practice – lessons from computer vision and computational biology

Spring Semester:

5.3

Sivan Toledo

Algorithms and Data Structures for Flash Memories

12.3

Eran Yahav

Systematic Derivation of Concurrent Garbage Collectors

19.3

No Colloquium (IAP meeting)

 

26.3

Ron Pinter

Modeling and Analysis of Biological Pathways

2.4

Uri Zwick

Overhang

9.4

Pesach

 

16.4

Pesach

 

23.4

Eran Segal

A Genomic Code for Nucleosome Positioning and Chromosome Function

30.4

Tzvika Hartman

Approximation Algorithms for Sorting by Transpositions

7.5

Oren Etzioni

All I Really Need to Know I Learned from Google

14.5

Oded Regev

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

21.5

Max Shatsky

The Common Point Set Problem with Applications to Protein Structure

Analysis

28.5

Ronen Feldman

Improving Self-Supervised Relation Extraction from the Web

4.6

Liam Roditty

Dynamic and Static Graph Algorithms

11.6

Nati Linial

Some new perspectives on complexity and their applications

 

2004-2005 colloquium

 

Spring semester 2004 colloquium

 

Fall semester 2003-4 colloquium


This page is maintained by Roded Sharan