2016 search results - page 360 / 404 » Megamaps: Construction and Examples |
CICLING
2001
Springer
14 years 2 months ago
2001
Springer
The availability of semantically tagged corpora is becoming a very important and urgent need for training and evaluation within a large number of applications but also they are th...
COLT
2001
Springer
14 years 2 months ago
2001
Springer
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
CONCUR
2001
Springer
14 years 2 months ago
2001
Springer
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
PKDD
2001
Springer
14 years 2 months ago
2001
Springer
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...
RTA
2001
Springer
14 years 2 months ago
2001
Springer
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...