73 search results - page 13 / 15 » The Complexity of Learning Concept Classes with Polynomial G... |
MICCAI
2000
Springer
13 years 11 months ago
2000
Springer
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
Separation of concerns has been central to software engineering for decades, yet its many advantages are still not fully realized. A key reason is that traditional modularization ...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
IJCAI
1989
13 years 8 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...