3353 search results - page 222 / 671 » Laver and set theory |
179
click to vote
ILP
2004
Springer
15 years 12 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
150
click to vote
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we introduce a new approach to axiomatizing quotient types in type theory. We suggest replacing the existing monolithic rule set by a modular set of rules for a speci...
169
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
162
click to vote
AAAI
2004
15 years 8 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
198
click to vote
NIPS
2001
15 years 8 months ago
2001
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...