Sciweavers

558 search results - page 106 / 112
» Conversational Case-Based Reasoning
Sort
View
98
Voted
SIGKDD
2000
150views more  SIGKDD 2000»
15 years 1 months ago
KDD-Cup 2000 Organizers' Report: Peeling the Onion
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...
IGPL
1998
115views more  IGPL 1998»
15 years 1 months ago
Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
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...
Fairouz Kamareddine, Alejandro Ríos
MSCS
2007
92views more  MSCS 2007»
15 years 1 months ago
Restriction categories III: colimits, partial limits and extensivity
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...
J. Robin B. Cockett, Stephen Lack
MUC
1991
15 years 5 months ago
University of Massachusetts: description of the CIRCUS system as used for MUC-3
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...
LICS
2002
IEEE
15 years 6 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
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...
Michael Benedikt, Leonid Libkin