Sciweavers

417 search results - page 32 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
14 years 1 months ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
CLEF
2009
Springer
13 years 9 months ago
Multilingual Query Expansion for CLEF Adhoc-TEL
In this paper we will briefly describe the approaches taken by the Cheshire (Berkeley) Group for the CLEF Adhoc-TEL 2009 tasks (Mono and Bilingual retrieval). Recognizing that man...
Ray R. Larson
TC
2011
13 years 3 months ago
Exact and Approximated Error of the FMA
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
Sylvie Boldo, Jean-Michel Muller
COLT
2004
Springer
14 years 1 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
SIROCCO
2010
13 years 10 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...