Sciweavers

1651 search results - page 30 / 331
» Measuring the Complexity of Classification Problems
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 2 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
ICIAP
2003
ACM
14 years 27 days ago
Classification with reject option in text categorisation systems
The aim of this paper is to evaluate the potential usefulness of the reject option for text categorisation (TC) tasks. The reject option is a technique used in statistical pattern...
Giorgio Fumera, Ignazio Pillai, Fabio Roli
NIPS
2000
13 years 9 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
CHI
2010
ACM
14 years 2 months ago
On reconstruction of task context after interruption
Theoretical accounts of task resumption after interruption have almost exclusively argued for resumption as a primarily memory-based process. In contrast, for many task domains, r...
Dario D. Salvucci
CSMR
1998
IEEE
13 years 12 months ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth