Sciweavers

3244 search results - page 175 / 649
» On convex complexity measures
Sort
View
ML
2000
ACM
185views Machine Learning» more  ML 2000»
15 years 1 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
VMV
2004
185views Visualization» more  VMV 2004»
15 years 3 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
JCSS
2008
120views more  JCSS 2008»
15 years 1 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
EUSFLAT
2007
107views Fuzzy Logic» more  EUSFLAT 2007»
15 years 3 months ago
Extending the Choquet integral
In decision under uncertainty, the Choquet integral yields the expectation of a random variable with respect to a fuzzy measure (or non-additive probability or capacity). In gener...
Giovanni Rossi
AMAI
2004
Springer
15 years 7 months ago
The Expressive Rate of Constraints
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
Hubie Chen