BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260405T121211EDT-0239E4BseC@132.216.98.100
DTSTAMP:20260405T161211Z
DESCRIPTION:Cellular tree classifiers\n\nAbstract\n\nSuppose that binary cl
 assification is done by a tree method in which the leaves of a tree corres
 pond to a partition of d-space. Within a partition\, a majority vote is us
 ed. Suppose furthermore that this tree must be constructed recursively by 
 implementing just two functions\, so that the construction can be carried 
 out in parallel by using 'cells': first of all\, given input data\, a cell
  must decide whether it will become a leaf or internal node in the tree. S
 econdly\, if it decides on an internal node\, it must decide how to partit
 ion the space linearly. Data are then split into two parts and sent downst
 ream to two new independent cells. We discuss the design and properties of
  such classifiers.\n
DTSTART:20161006T193000Z
DTEND:20161006T203000Z
LOCATION:room 1205\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Luc Devroye\, McGill University
URL:https://www.mcgill.ca/mathstat/channels/event/luc-devroye-mcgill-univer
 sity-263279
END:VEVENT
END:VCALENDAR