1017 search results - page 16 / 204 » Register computations on ordinals |
EUROCOLT
1999
Springer
13 years 12 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
ECCV
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and various sources of intra-class ...
WSC
2004
13 years 9 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
WSC
2007
13 years 10 months ago
2007
We consider the problem of selecting the best system using simulation-based ordinal optimization. This problem has been studied mostly in the context of light-tailed distributions...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...