2373 search results - page 51 / 475 » On the Theory of Structural Subtyping |
LICS
2000
IEEE
15 years 2 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
COCO
1995
Springer
15 years 1 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
NIPS
2000
14 years 11 months ago
2000
We use graphical models to explore the question of how people learn simple causal relationships from data. The two leading psychological theories can both be seen as estimating th...
104
click to vote
FOCM
2010
14 years 8 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
160
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...