2080 search results - page 9 / 416 » Measuring empirical computational complexity |
134
click to vote
HPDC
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
112
click to vote
ICPR
2000
IEEE
16 years 2 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
125
click to vote
JMLR
2010
14 years 8 months ago
2010
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
120
click to vote
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences....
80
Voted
IWPC
2010
IEEE
15 years 9 days ago
2010
IEEE
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...