4190 search results - page 287 / 838 » Type Class Directives |
127
click to vote
AMAST
2006
Springer
15 years 8 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
125
click to vote
IDEAL
2000
Springer
15 years 8 months ago
2000
Springer
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
147
click to vote
CAIP
2009
Springer
15 years 8 months ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
192
click to vote
AAAI
2007
15 years 7 months ago
2007
Multi-label learning deals with ambiguous examples each may belong to several concept classes simultaneously. In this learning framework, the inherent ambiguity of each example is...
157
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...