Sciweavers

9842 search results - page 1501 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IJCNN
2000
IEEE
15 years 11 months ago
Sensitivity Analysis for Conic Section Function Neural Networks
Sensitivity analysis is a method for extracting the cause and effect relationship between the inputs and outputs of the network. After training a neural network, one may want to k...
Lale Özyilmaz, Tülay Yildirim
IJCNN
2000
IEEE
15 years 11 months ago
On MCMC Sampling in Bayesian MLP Neural Networks
Bayesian MLP neural networks are a flexible tool in complex nonlinear problems. The approach is complicated by need to evaluate integrals over high-dimensional probability distri...
Aki Vehtari, Simo Särkkä, Jouko Lampinen
ISQED
2000
IEEE
91views Hardware» more  ISQED 2000»
15 years 11 months ago
Probabilistic Bottom-Up RTL Power Estimation
We address the problem of power estimation at the register-transfer level (RTL). At this level, the circuit is described in terms of a set of interconnected memory elements and co...
Ricardo Ferreira, A.-M. Trullemans, José C....
VRST
2000
ACM
15 years 11 months ago
DEVA3: architecture for a large-scale distributed virtual reality system
In this paper we present the work undertaken by the Advanced Interfaces Group at the University of Manchester into the design and development of a system to support large numbers ...
Steve Pettifer, Jonathan Cook, James Marsh, Adrian...
ADC
2000
Springer
82views Database» more  ADC 2000»
15 years 11 months ago
Querying Databases of Annotated Speech
Annotated speech corpora are databases consisting of signal data along with time-aligned symbolic ‘transcriptions’. Such databases are typically multidimensional, heterogeneou...
Steve Cassidy, Steven Bird
« Prev « First page 1501 / 1969 Last » Next »