16666 search results - page 2781 / 3334 » Descriptive and Computational Complexity |
194
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
215
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
190
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
157
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
175
click to vote
HT
2009
ACM
16 years 1 months ago
2009
ACM
Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. I...