We describe KDD-Cup 2000, the yearly competition in data mining. For the first time the Cup included insight problems in addition to prediction problems, thus posing new challenge...
Ron Kohavi, Carla E. Brodley, Brian Frasca, Llew M...
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding -conversion and being as close to machines as possible. De Bru...
ction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of...
ind this work was to extract a relatively abstract level of information from each sentence , using only a limited vocabulary that was hand-crafted to handle a restricted set of tar...
Wendy G. Lehnert, Claire Cardie, David Fisher, Ell...
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...