Sciweavers

3244 search results - page 21 / 649
» On convex complexity measures
Sort
View
CAE
2007
15 years 1 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert
TSMC
1998
108views more  TSMC 1998»
14 years 11 months ago
The measurement of a design structural and functional complexity
— The complexity of a design process or a design artifact substantially influences their performance. When evaluation of terms such as “design complexity” and its “quality...
Dan Braha, Oded Maimon
PR
2006
83views more  PR 2006»
14 years 11 months ago
Optimal convex error estimators for classification
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
Chao Sima, Edward R. Dougherty
ARTMED
2006
75views more  ARTMED 2006»
14 years 11 months ago
Semi-automatic learning of simple diagnostic scores utilizing complexity measures
Objective: Knowledge acquisition and maintenance in medical domains with a large application domain ontology is a difficult task. To reduce knowledge elicitation costs, semiautoma...
Martin Atzmüller, Joachim Baumeister, Frank P...
AMC
2007
108views more  AMC 2007»
14 years 11 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh