BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Boolean Methods in High-Performance Text Search
DTSTART:20170612T141500
DTEND:20170612T150000
DTSTAMP:20260406T152210Z
UID:61e82532e51d92c9dacaf7fe56e8f640f78f4290065b372997aab02f
CATEGORIES:Conferences - Seminars
DESCRIPTION:Igor L. Markov\, Google and Michigan University\nModern inform
 ation retrieval systems build large indices that support search queries wi
 th Boolean operators. Performance optimization raises interesting challeng
 es in terms of processing Boolean formulas\, while the evolution of search
  applications calls for new features. In this talk\, we briefly review how
  modern search systems operate and discuss some of the Boolean challenges 
 encountered in production-bound work.\n\nBio: Igor L. Markov is a professo
 r of Electrical Engineering and Computer Science at the University of Mich
 igan on leave at Google. He received a Ph.D. in Computer Science from UCLA
 \, is currently an IEEE Fellow\, and an ACM Distinguished Scientist. He se
 rved on editorial boards of several ACM and IEEE Transactions\, and chaire
 d tracks at DAC\, ICCAD\, ICCD\, DATE and GLSVLSI. Prof. Markov's research
  is in applied algorithms\, large-scale optimization\, and computers that 
 make computers. He has co-authored five books\, four US patents\, and over
  200 refereed publications. During the 2011 redesign of the ACM Computing 
 Classification System\, Prof. Markov led the effort on the Hardware tree. 
 He is the recipient of the NSF CAREER award\, IEEE CEDA Early Career Award
  and ACM SIGDA Outstanding New Faculty Award.
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR