2080 search results - page 234 / 416 » Measuring empirical computational complexity |
322
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
157
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
157
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
165
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
167
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...