4698 search results - page 15 / 940 » Making Functionality More General |
125
click to vote
HICSS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we study the modelling of consensus reaching in a ‘soft’ environment, i.e. when the individual testimonies are expressed as fuzzy preference relations. Here cons...
107
click to vote
ALT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
128
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
115
Voted
NIPS
2007
15 years 3 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
130
click to vote
CSFW
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...