513 search results - page 64 / 103 » Finitely Based, Finite Sets of Words |
100
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of ordinal classification, in which a value set of the decision attribute (output, dependent variable) is finite and ordered. This problem shares some chara...
129
click to vote
AWPN
2008
15 years 1 months ago
2008
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
SIAMCO
2002
14 years 11 months ago
2002
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
SIAMNUM
2010
14 years 6 months ago
2010
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in th...
FSMNLP
2005
Springer
15 years 5 months ago
2005
Springer
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...