Sciweavers

6142 search results - page 153 / 1229
» The Complexity of Partition Functions
Sort
View
ICML
2004
IEEE
15 years 3 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
CCA
2005
Springer
15 years 2 days ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 5 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze
IJCNN
2000
IEEE
15 years 2 months ago
Taxonomy of Neural Transfer Functions
The choice of transfer functions may strongly influence complexity and performance of neural networks used in classification and approximation tasks. A taxonomy of activation an...
Wlodzislaw Duch, Norbert Jankowski
67
Voted
MSE
2000
IEEE
133views Hardware» more  MSE 2000»
15 years 2 months ago
Multimodal Presentation Markup Language MPML With Emotion Expression Functions Attached
With the increase of multimedia contents in the WWW, multimodal presentation using interactive life-like agents is attractive and becoming important. However, it is not easy for m...
Yuan Zong, Hiroshi Dohi, Mitsuru Ishizuka