We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
General Game Playing is the problem of designing an agent capable of playing any previously unknown game when given only the rules. This paper describes the implementation archite...
This paper describes a method for suppressing spatial conflicts in cartographic generalization of isobathymetric lines. These lines are modeled by parametric curves. For that purp...
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...