332 search results - page 4 / 67 » An Aristotelian notion of size |
84
Voted
UAI
2008
14 years 11 months ago
2008
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
COCO
2003
Springer
15 years 2 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
AGILEDC
2005
IEEE
15 years 3 months ago
2005
IEEE
In an effort to improve our understanding of the way we work, my team grouped together ideas from various sources to come up with an estimation scheme that avoided the confusing n...
110
click to vote
FSMNLP
2009
Springer
14 years 7 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
ILP
2003
Springer
15 years 2 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...