Sciweavers

12334 search results - page 219 / 2467
» The Use of C
Sort
View
CORR
2010
Springer
72views Education» more  CORR 2010»
15 years 6 months ago
Porting Decision Tree Algorithms to Multicore using FastFlow
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
Marco Aldinucci, Salvatore Ruggieri, Massimo Torqu...
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
A connection between palindromic and factor complexity using return words
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
IJAR
2008
88views more  IJAR 2008»
15 years 6 months ago
Clustering decomposed belief functions using generalized weights of conflict
We develop a method for clustering all types of belief functions, in particular non-consonant belief functions. Such clustering is done when the belief functions concern multiple ...
Johan Schubert
IJDMMM
2008
87views more  IJDMMM 2008»
15 years 6 months ago
Is an ordinal class structure useful in classifier learning?
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Jens C. Huhn, Eyke Hüllermeier
IJAR
2007
69views more  IJAR 2007»
15 years 6 months ago
Decision making under uncertainty using imprecise probabilities
Various ways for decision making with imprecise probabilities—admissibility, maximal expected utility, maximality, E-admissibility, Γ-maximax, Γ-maximin, all of which are well...
Matthias C. M. Troffaes