8838 search results - page 428 / 1768 » Generalizing Domain Theory |
199
click to vote
COLT
1998
Springer
15 years 12 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
214
click to vote
COMPGEOM
2007
ACM
15 years 11 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
217
click to vote
WM
2003
15 years 9 months ago
2003
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
192
click to vote
IJCAI
1989
15 years 8 months ago
1989
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
182
click to vote
IJAR
2008
15 years 7 months ago
2008
There exist many tools for capturing imprecision in probabilistic representations. Among them are random sets, possibility distributions, probability intervals, and the more recen...