3571 search results - page 367 / 715 » Cohen and Set Theory |
219
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
165
click to vote
JCDL
2006
ACM
16 years 22 days ago
2006
ACM
Currently in document retrieval there are many algorithms each with different strengths and weakness. There is some difficulty, however, in evaluating the impact of the test quer...
205
click to vote
HYBRID
2001
Springer
15 years 11 months ago
2001
Springer
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
178
click to vote
COLT
1993
Springer
15 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
225
click to vote
TIFS
2008
15 years 6 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...