Sciweavers

509 search results - page 33 / 102
» Standardization and Testing of Mathematical Functions
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
14 years 1 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
JMLR
2010
130views more  JMLR 2010»
13 years 5 months ago
A Regularization Approach to Nonlinear Variable Selection
In this paper we consider a regularization approach to variable selection when the regression function depends nonlinearly on a few input variables. The proposed method is based o...
Lorenzo Rosasco, Matteo Santoro, Sofia Mosci, Ales...
INTERSPEECH
2010
13 years 5 months ago
A classifier-based target cost for unit selection speech synthesis trained on perceptual data
Our goal is to automatically learn a perceptually-optimal target cost function for a unit selection speech synthesiser. The approach we take here is to train a classifier on human...
Volker Strom, Simon King
ICONIP
1998
13 years 11 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
14 years 1 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...