Lossless compression via two-level logic minimization: a case study using Chess endgame data

Lossless compression via two-level logic minimization: a case study using Chess endgame data

Dave Gomboc

Dave Gomboc holds an M.Sc. in Computing Science from the University of Alberta. He has held staff positions at the University of Alberta and the University of Southern California, where he made contributions to eXplainable Artificial Intelligence. Dave currently works full-time in industry, and pursues a Ph.D. in his spare time at the University of California, Riverside.
Sat 9:30 pm - 12:00 am