Date & Time

Title

Speaker

Monday

January 19^th

8:45

Opening Remarks

Gyuri Turan - Chair:

9:00 - 9:45

Molecular Computing and Probabilistic Circuits

Shuki Bruck

9:45 - 10:30

Multi-level Logic with Constant Depth: Recent Research from Italy

Tiziano Villa

Break

11:00 - 11:30

Competitive Evaluation of Threshold Functions and Game Trees in the Priced Information Model

Ferdinando Cicalese

11:30 - 12:00

(continuation of Competitive Evaluation of Threshold Functions)

Martin Milanic

Lunch

Martin Anthony - Chair:

2:00-2:30

Nondisjoint Decomposition of Monotone Boolean Functions

Cor Bioch

2:30 - 3:00

Models of Voting Power in Corporate Networks

Yves Crama

3:00 - 3:30

Nash-solvability and Boolean duality

Vladimir Gurvich

Break

4:30 - 5:00

Reverse-engineering Country Risk Ratings: A Combinatorial Non-Recursive Model

Alex Kogan

5:00 - 5:30

Large Margin LAD Models and LAD-based Regression

Tiberius Bonates

6:00 - 7:00

Reception

Tuesday

January 20^th

Yves Crama - Chair:

9:00 - 9:45

Boolean Decision Trees: Problems and Results, Old and New

Michael Saks

9:45 - 10:30

Adding Unsafe Constraints to Improve SAT Solver Performance

John Franco

Break

11:00 - 11:30

Exclusive and Essential Sets of Implicates of a Boolean Function

Ondrej Cepek

11:30 - 12:00

Coverable Boolean Functions

Petr Kucera

Lunch

Shuki Bruck - Chair:

2:00 - 2:30

Threshold Decision Lists

Martin Anthony

2:30 - 3:00

The Largest Number of Prime Implicants of k-term DNF and Cube Partitions

Robert Sloan

3:00 - 3:30

On Approximate Horn Minimization

Gyorgy Turan

Break

4:00-4:30

Robust diagnosis of DLBCL from gene expression data from different laboratories

Gabriela Alexe

4:30-5:00

Improved Branch and Bound Methods for Maximum Monomial Agreement

Noam Goldberg

5:00-5:30

Logical Analysis of Data (LAD) Applied to Mass Spectrometry Data to Predict Rate of Decline of Kidney Function

Michael Lipkowitz

Mine Subasi

Wednesday

January 21st

Toshi Ibaraki - Chair:

9:00 - 9:45

Correlation Immune Functions and Learning

Lisa Hellerstein

9:45 - 10:30

Fourier Analysis and Boolean Function Learning

Jeff Jackson

Break

11:00 - 11:30

Recognition of Positive k-interval Functions

David Kronus

11:30 - 12:00

Structures of Renamable Horn and q-Horn Formulae

Richard Sun

Lunch

Lisa Hellerstein - Chair:

2:00 - 2:45

Combinatorial Patterns for Probabilistically Constrained Optimization Problems

Miguel Lejeune

2:45 - 3:30

On Various Relaxations Based on Reformulation-Linearization for 0-1 MIPs and their Specialization to Pseudo-Boolean Optimization

Michele Minoux

Break

4:00 - 4:30

What Can and What Has To Be Learned From Data

Endre Boros

4:30 - 5:00

On the Chvatal-Complexity of Binary Knapsack Problems

Bela Vizvari

5:00 - 5:30

Construction of a Maximum Stable Set with k-Extensions

Igor Zverovich

Thursday

January 22^nd

Michel Minoux - Chair:

9:00 - 9:45

Participating in Timetabling Competition ITC2007 with a General Prupose CSP Solver

Toshihide Ibaraki

9:45 - 10:30

Learning, Testing and Approximating Halfspaces

Rocco Servedio

Break

11:00 - 11:30

The Impact of Pseudo-Boolean Optimization on Computer Vision and Graphics

Ramin Zabih

11:30 - 12:00

The Expressive Power of Binary Submodular Functions

Stanislav Zivny

Lunch