1088 search results - page 5 / 218 » Independence of Negative Constraints |
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an appr...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
PAKDD
2004
ACM
14 years 22 days ago
2004
ACM
GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user...
JMLR
2010
13 years 2 months ago
2010
We study the problem of active learning with convex loss functions. We prove that even under bounded noise constraints, the minimax rates for proper active learning are often no b...
GOSLER
1995
13 years 11 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...