Sciweavers

2080 search results - page 9 / 416
» Measuring empirical computational complexity
Sort
View
HPDC
2010
IEEE
13 years 11 months ago
A hybrid Markov chain model for workload on parallel computers
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
Anne Krampe, Joachim Lepping, Wiebke Sieben
ICPR
2000
IEEE
14 years 11 months ago
Measuring the Complexity of Classification Problems
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...
Tin Kam Ho, Mitra Basu
JMLR
2010
119views more  JMLR 2010»
13 years 4 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
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...
Mahito Sugiyama, Akihiro Yamamoto
ECAI
2010
Springer
13 years 11 months ago
An Empirical Study of the Manipulability of Single Transferable Voting
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....
Toby Walsh
IWPC
2010
IEEE
13 years 8 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
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 ...
Dirk Beyer, Ashgan Fararooy