2664 search results - page 256 / 533 » Theory of processes |
216
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
186
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
169
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
160
click to vote
ISPW
2009
IEEE
16 years 1 months ago
2009
IEEE
: Software qualities are in many cases tacit and hard to measure. Thus, there is a potential risk that they get lower priority than deadlines, cost and functionality. This paper pr...
144
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...